circagraph
Sign inSign up

Type theory and functional programming: a history

From Frege's Begriffsschrift and Russell's theory of types to the lambda calculus, Curry–Howard, ML and Haskell, dependent types and proof assistants, and functional ideas in mainstream languages. Moments are tagged (type theory, logic, lambda calculus, category theory, proof assistants, languages, compilers & implementation, effects, people) and colored by their first tag; eras are shown as spans and lines trace lineages. Dates are publication or release dates unless a note says otherwise. Summaries are our own; each moment links to its Wikipedia sources.

Duration correction: Ongoing subjects previously drawn through a present/research cutoff are represented at their original starts, with no end asserted. Existing moments at those coordinates are reused; their attached cards retain the former duration’s notes, sources, tags and media. Bounded historical and coverage intervals remain durations.

82 moments · 1879 CE – 2025 CE · by @athan · @athan

Scott's domain theory

  • lambda calculus
  • logic

Dana Scott’s domain-theoretic work around 1969 supplied mathematical models for the untyped lambda calculus using ordered structures and continuous functions. Approximation and fixed points made recursive computation interpretable within a carefully constructed semantic setting. This addressed a foundational question: how could functions that apply to themselves receive a coherent mathematical interpretation? Domain theory also became important in denotational semantics for programming languages. Its notion of continuity concerns order-theoretic information and should not be confused automatically with ordinary real-variable continuity. **Timeline anchor:** 1 January 1969 CE. Developed 1969–1970. **References:** [Source 1](https://en.wikipedia.org/wiki/Domain_theory), [Source 2](https://en.wikipedia.org/wiki/Dana_Scott).

Sources

On other timelines

Open Scott's domain theory in the timeline