Semantics of Programming Languages: Structures and Techniques (Foundations of Computing) (Hardcover)

~ (Author) "The methods and objectives of semantics of programming languages are different in many ways from those of the semantics of natural language and mathematical logic..." (more)
Key Phrases: stable function space, determined colimits, primitive syntax class, Fixed-Point Theorem, Prove Lemma, Unwinding Theorem (more...)

Editorial Reviews

Review

"Gunter's book treats the essence of programming language theory—the span between the "meaning" of a computer program, and the concrete and intricate ways in which programs are executed by a machine. He brings together the established theoretical advances in this range. It is rewarding for someone who has played a small part in these developments to see them laid out so expertly, and with such pedagogic concern; readers new to the field—and many who already know a lot about it—will also be rewarded by following its carefully designed path."
—Professor Robin Milner, University of Edinburgh

Product Description

"Gunter's book treats the essence of programming language theory -- the span between the "meaning" of a computer program, and the concrete and intricate ways in which programs are executed by a machine. He brings together the established theoretical advances in this range. It is rewarding for someone who has played a small part in these developments to see them laid out so expertly, and with such pedagogic concern; readers new to the field -- and many who already know a lot about it -- will also be rewarded by following its carefully designed path." -- Professor Robin Milner, University of Edinburgh

Semantics of Programming Languages exposes the basic motivations and philosophy underlying the applications of semantic techniques in computer science. It introduces the mathematical theory of programming languages with an emphasis on higher-order functions and type systems. Designed as a text for upper-level and graduate-level students, the mathematically sophisticated approach will also prove useful to professionals who want an easily referenced description of fundamental results and calculi. Basic connections among computational behavior, denotational semantics, and the equational logic of functional programs are thoroughly and rigorously developed. Topics covered include models of types, operational semantics, category theory, domain theory, fixed-point (denotational) semantics, full abstraction and other semantic correspondence criteria, types and evaluation, type checking and inference, parametric polymorphism, and subtyping. All topics are treated clearly and in depth, with complete proofs for the major results and numerous exercises. Foundations of Computing series

See all Editorial Reviews

Product Details

• Hardcover: 441 pages
• Publisher: The MIT Press (September 14, 1992)
• Language: English
• ISBN-10: 0262071436
• ISBN-13: 978-0262071437
• Product Dimensions: 9.3 x 7.3 x 1.2 inches
• Shipping Weight: 2 pounds (View shipping rates and policies)
• Average Customer Review: 4.0 out of 5 stars  See all reviews (2 customer reviews)
• Amazon.com Sales Rank: #922,314 in Books (See Bestsellers in Books)

Customer Reviews

Most Helpful Customer Reviews

6 of 6 people found the following review helpful:

4.0 out of 5 stars Deep, lucid, interesting textbook on formal semantics using the lambda calculus., May 11, 2006

By	Benjamin L. Russell "Aspiring Researcher of P... (Tokyo, Japan) - See all my reviews (REAL NAME)

As an undergraduate student in the Computer Science major at Yale University during the spring semester of 1992 - 93, I used this textbook in Professor Paul Hudak's class "Computer Science 430b: Formal Semantics."

Personally, I enjoyed using this textbook. It went into great detail into the theory of formal semantics of programming languages, using the lambda calculus. Having come from a background in the Scheme programming language, I immediately found the syntax of the lambda calculus familiar, as it had originally been used as the basis for the LISP programming language, of which Scheme was a variant.

Most of the equations and proofs were clear and relatively easy to understand with reasonable effort, although Professor Hudak did suggest more elegant alternatives for some of the equations.

The simply-typed lambda calculus, introduced in Chapter 2, proved a relatively easy-to-understand beginning basis for grasping the concepts of formal semantics. The book ventured on to discuss category theory, fixed-point semantics, untyped lambda calculus, and domain theory, among many other topics. In particular, I found the discussions on the simply-typed lambda calculus, category theory, and domain theory interesting.

This textbook, together with Paul Hudak's crisp and easy-to-understand teaching style, remain as some of my more pleasant memories from the otherwise brutal and grinding Yale computer science curriculum. Together, they are part of the reason that Scheme, with its basis on the lambda calculus, remains one of my favorite programming languages for the study of programming methodologies.

Benjamin L. Russell

1 of 6 people found the following review helpful:

4.0 out of 5 stars Theoretical computer science - Semantics, February 20, 2003

By	Asim (S'pore) - See all my reviews

This book has a deep coverage; should be enjoyed with a lot of patience and suitable cross references.