Math 2.0

Computer science Semantics and logic in computer science Concept

Denotational semantics

Builds on Scott domainLeast fixed point

Summary

Denotational semantics gives meaning to a programming language by mapping each program to a mathematical object, its denotation. A typical denotation is a function between sets or between domains. The map is compositional: the meaning of a compound program is computed from the meanings of its parts. Christopher Strachey and Dana Scott founded the approach, and Scott built domains so that recursive programs could be given meanings as least fixed points. It lets one prove two programs equivalent by showing that they have the same denotation.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Least fixed point, concept, no evidence levelLeast fixed pointconceptScott domain, concept, no evidence levelScott domainconceptDenotational semantics, concept, no evidence levelDenotational semanticsconcept
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Least fixed point concept
  2. Scott domain concept
  3. Denotational semantics concept

Further reading

  1. Web https://en.wikipedia.org/wiki/Denotational_semantics
About this page
TagK98QRB3700
URIm2://K98QRB3700
Kindconcept
WritingW0 stub
MSC68Q55, 06B35
UsesScott domain, Least fixed point
Same as
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Definitions