Semantics of Programming Languages: Structures and Techniques

Front Cover
MIT Press, 1992 - Computers - 419 pages

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 between 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.

 

Contents

The SimplyTyped Calculus
31
Categorical Models of Simple Types
63
Recursive Definitions of Functions
97
Two Theories of Finite Approximation
145
Relating Interpretations
177
Types and Evaluation
217
Universal Domains
255
Subtype Polymorphism
285
Domain Theory
315
Parametric Polymorphism
357
Copyright

Other editions - View all

Common terms and phrases

Popular passages

Page 397 - M. Coppo, M. Dezani-Ciancaglini, and B. Venneri. Functional characters of solvable terms.

About the author (1992)

Carl A. Gunter is Professor in the Department of Computer and Information Science at the University of Pennsylvania.

Bibliographic information