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

Theorems for free!

  • type theory

Philip Wadler’s 1989 Theorems for Free! explained how parametric polymorphism can impose useful relationships on a function’s behavior. Building on Reynolds’s parametricity, a sufficiently uniform type can yield a theorem without inspecting a particular implementation. The result depends on the language and semantic assumptions. Effects, nontermination and operations that inspect representations can complicate a naive reading. The significance is a bridge from an interface’s type to reasoning about programs, rather than a claim that a type alone reveals every detail of a function’s output. **Timeline anchor:** 1 January 1989 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/Parametricity).

Sources

Related

Open Theorems for free! in the timeline