Placeholder text

Go to cart

The Formal Semantics of Programming Languages

By Glynn Winskel

Product Image: The Formal Semantics of Programming Languages

The Formal Semantics of Programming Languages

Only 1 item left in stock
Description
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.
Product details
Binding:
Paperback
Edition:
1
Number of Pages:
384
Release Date:
1993-02-05
Publication Date:
1993-02-05
Publisher:
MIT Press
Languages:
Original: English
ISBN10:
02627310370262529432
ISBN13:
9780262731034
GPSR Manufacturer Reference:
[email protected]
Minimum Reading Age:
18
Weight:
650 g
Height:
178 cm
Width:
229 cm
Thickness:
21 cm
Buy on Amazon

Condition

Show more

Show less
Very good
Almost no signs of wear. Book pages have no markings, accessories are intact and all other media are in good condition.
Available immediately
€44,59

Incl. VAT, plus shipping costs

PayPal
Visa
Mastercard
American Express
Only 1 item left in stock

Verified second-hand article

Verified second-hand item

Free shipping from 19€

€44,59