---
title: "Semantics of Programming Languages: Structures and Techniques"
authors:
  - "Carl A. Gunter"
year: 1992
venue: "MIT Press"
arxiv: null
doi: null
source: "https://mitpress.mit.edu/9780262570954/semantics-of-programming-languages/"
topics:
  - semantics
  - gunter
  - domain-theory
  - textbook
seed_rank: 714
seed_batch: "perfects-pl-2026-08-13"
reviewed: "2026-08-13"
pool: "languages"
relevance_score: 10
lineage: programming-language-foundations
cites:
  - title: "Domains for Denotational Semantics"
    url: "https://doi.org/10.1007/BFb0012801"
    year: 1982
    arxiv: null
    doi: "10.1007/BFb0012801"
  - title: "LCF Considered as a Programming Language"
    url: "https://doi.org/10.1016/0304-3975(77)90044-5"
    year: 1977
    arxiv: null
    doi: "10.1016/0304-3975(77)90044-5"
  - title: "Fundamental Concepts in Programming Languages"
    url: "https://doi.org/10.1023/A:1010000313106"
    year: 1967
    arxiv: null
    doi: "10.1023/A:1010000313106"
  - title: "Toward a Mathematical Semantics for Computer Languages"
    url: "https://www.cs.ox.ac.uk/files/3228/PRG06.pdf"
    year: 1971
    arxiv: null
    doi: null
see:
  - "656-domains-for-denotational-semantics"
  - "657-lcf-considered-as-a-programming-language"
  - "615-fundamental-concepts-in-programming-languages"
  - "612-toward-a-mathematical-semantics-for-computer-languages"
---

# Semantics of Programming Languages: Structures and Techniques

## One-sentence takeaway

Graduate denotational semantics is organized as reusable domain-theoretic constructions — products, function spaces, recursive types, adequacy — rather than as a tour of particular languages.

## Why it matters here

Winskel teaches the three styles on IMP; Gunter is the techniques book you open when an Anoptic language has higher-order store, recursive types, or a full-abstraction question. It is how Scott domains and Plotkin LCF become tools instead of papers.

## Key ideas

- Universal domains and the usual type constructors are built so language features have standard interpretations.
- Adequacy and the setup for full abstraction are treated as techniques, with PCF-shaped case studies.
- Untyped and typed calculi are both in scope; the book is closer to Scott–Plotkin than to a Hoare-logic course.
- Strachey’s fundamental concepts and Scott–Strachey denotational semantics are the cited roots.
- MIT Press Foundations of Computing, 1992 (ISBN 978-0-262-57095-4).

## Caveats

## Links

- MIT Press: https://mitpress.mit.edu/9780262570954/semantics-of-programming-languages/