Billedgalleri
(1/1)
The Formal Semantics of Programming Languages – lærebog i informationsteknologi
Til salg
350 kr.
Fragt fra 29,99 kr. + Tryg betaling 21 kr.
Tryg handel med Fiks færdig
Efter leveringen har du 24 timer til at kontrollere produktet. Hvis der er noget galt med produktet, får du dine penge tilbage
Varebeskrivelse
Stand: Som ny - ingen synlige brugsspor
Emne: Informationsteknologi
Lærebog i informationsteknologi: The Formal Semantics of Programming Languages af Glynn Winskel. Paperback med blå forside og grafiske figurer på omslaget.
Detaljer
SprogEngelsk
Sidetal384
Udgivelsesdato05-02-1993
ISBN139780262731034
ForlagMit Press Ltd
FormatPaperback
Beskrivelse
The Formal Semantics of Programming Languages provides the basic mathematical techniques necessary for those who are beginning a study of the semantics and logics of programming languages. These techniques will allow students to invent, formalize, and justify rules with which to reason about a variety of programming languages. Although the treatment is elementary, several of the topics covered are drawn from recent research, including the vital area of concurency. The book contains many exercises ranging from simple to miniprojects.Starting with basic set theory, structural operational semantics is introduced as a way to define the meaning of programming languages along with associated proof techniques. Denotational and axiomatic semantics are illustrated on a simple language of while-programs, and fall proofs are given of the equivalence of the operational and denotational semantics and soundness and relative completeness of the axiomatic semantics. A proof of Godel's incompleteness theorem, which emphasizes the impossibility of achieving a fully complete axiomatic semantics, is included. It is supported by an appendix providing an introduction to the theory of computability based on while-programs. Following a presentation of domain theory, the semantics and methods of proof for several functional languages are treated. The simplest language is that of recursion equations with both call-by-value and call-by-name evaluation. This work is extended to lan guages with higher and recursive types, including a treatment of the eager and lazy lambda-calculi. Throughout, the relationship between denotational and operational semantics is stressed, and the proofs of the correspondence between the operation and denotational semantics are provided. The treatment of recursive types - one of the more advanced parts of the book - relies on the use of information systems to represent domains. The book concludes with a chapter on parallel programming languages, accompanied by a discussion of methods for specifying and verifying nondeterministic and parallel programs.
Bemærk: Knappen til at vise den fulde beskrivelse har kun en visuel effekt.
Brugerprofil
Du skal være logget ind for at se brugerprofiler og sende beskeder.
Log indAnnoncens metadata
Sidst redigeret: 30.7.2026 kl. 21:07 ・ Annonce-ID: 23507073
