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.
FREE Two-Day Shipping for Students. Learn more |
 Sell Back Your Copy for $19.66
Whether you buy it used on Amazon for $30.00 or somewhere else, you can sell it back through our Book Trade-In Program at the current price of $19.66.
Used Price$30.00
Trade-in Price$19.66
Price after
Trade-in$10.34 |
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Frequently Bought Together
Editorial Reviews
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?
|
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
3 of 11 people found the following review helpful:
2.0 out of 5 stars
Not recommend for a PL beginner.,
By
Amazon Verified Purchase(What's this?)
This review is from: Formal Semantics of Programming Languages (Paperback)
Bought this book for a graduate PL class. For the most part, the book covers basic semantics and syntax of PL, but does't provide enough explanations and examples so it's difficult to understand for a PL beginner!
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
Citations (learn more)
67
books
cite this book:
See all 67 books citing this book
- Control Flow Semantics (Foundations of Computing) by Jaco de Bakker in Front Matter, Back Matter (1), and Back Matter (2)
- Foundations of Software Technology and Theoretical Computer Science: 14th Conference, Madras, India, December 15 - 17, 1994. Proceedings (Lecture Notes in Computer Science) by P.S. Thiagarajan on page 76, and page 88
- Theorem Proving in Higher Order Logics: 15th International Conference, TPHOLs 2002, Hampton, VA, USA, August 20-23, 2002. Proceedings (Lecture Notes in Computer Science) by Victor A. Carreno on page 98, and page 114
- Theorem Proving in Higher Order Logics: 16th International Conference, TPHOLs 2003, Rom, Italy, September 8-12, 2003, Proceedings (Lecture Notes in Computer Science) by David Basin on page 54, and page 269
- Higher Order Logic Theorem Proving and Its Applications: 6th International Workshop, HUG '93, Vancouver, B.C., Canada, August 11-13, 1993. Proceedings (Lecture Notes in Computer Science) by Jeffrey J. Joyce on page 28, and page 309
See all 67 books citing this book
What Other Items Do Customers Buy After Viewing This Item?
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 Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
|
|
So You'd Like to...
Look for Similar Items by Category
- Books > Computers & Technology > Computer Science
- Books > Computers & Technology > Programming > Languages & Tools
- Books > Computers & Technology > Software
- Books > New & Used Textbooks > Computer Science > Programming Languages
- Books > New & Used Textbooks > Science & Mathematics > Mathematics
- Books > Science & Math > Mathematics
