Frequently Bought Together
Customers Who Bought This Item Also Bought
Semantics of Programming Languages: Structures and Techniques (Foundations of Computing) by Carl A. Gunter |
by Franklyn A. Turbak
|
by Benjamin C. Pierce
|
by Thomas H. Cormen
|
by John C. Reynolds
|
Editorial Reviews
Product 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.
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.
About the Author
Glynn Winskel is Professor of Computer Science at the University of Aarhus, Denmark.
Product Details
Would you like to update product info or give feedback on images?
|
What Do Customers Ultimately Buy After Viewing This Item?
 |
72% buy the item featured on this page: Formal Semantics of Programming Languages $30.90 |
 |
11% buy Types and Programming Languages $58.23 |
 |
6% buy Advanced Topics in Types and Programming Languages$45.90 |
 |
6% buy The Haskell Road to Logic, Maths and Programming (Texts in Computing) $22.50 |
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Reviews
|
Share your thoughts with other customers:
|
|||||||||
Most Helpful Customer Reviews
Share your thoughts with other customers: Create your own review
|
 |
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Listmania!
|
|
So You'd Like to...
|
|
Product Information from the Amapedia Community
Beta (What's this?)Be the first person to add an article about this item at Amapedia.com.
› See featured Amapedia.com articles
Look for Similar Items by Category
Look for Similar Items by Subject
Your Recent History
(What's this?)|
After viewing product detail pages or search results, look here to find an easy way to navigate back to pages you are interested in. |
