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

The Calculus of Constructions

  • type theory
  • proof assistants

Thierry Coquand and Gérard Huet developed the Calculus of Constructions in the 1980s, combining dependent types with higher-order polymorphism in a compact typed calculus. Terms and types interact through carefully controlled formation and computation rules. The calculus became a major foundation for proof-assistant development. Coq’s later underlying theory includes inductive constructions and further developments, so the original calculus should not be equated with every facility in a modern prover. Its significance is a coherent combination of expressive type-theoretic mechanisms with a logical interpretation. **Timeline anchor:** 1 January 1985 CE. Coquand's thesis 1985; journal paper 1988. **References:** [Source 1](https://en.wikipedia.org/wiki/Calculus_of_constructions), [Source 2](https://en.wikipedia.org/wiki/Thierry_Coquand).

Sources

Related

On other timelines

Open The Calculus of Constructions in the timeline