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

Typed lambda calculi and Curry–Howard

–

  • era

This band follows typed calculi and the propositions-as-types correspondence, from simple type systems toward polymorphism and richer proof interpretations. A typing judgment can correspond to a logical derivation, while evaluation can mirror normalization of a proof. The correspondence is exact only for specified systems and translations. It does not make every real-world program a terminating proof or every language extension logically harmless. The selected period highlights foundational work whose consequences continued through later proof assistants and programming languages. **Interval represented:** 1 January 1940 CE to 1 January 1980 CE.

Open Typed lambda calculi and Curry–Howard in the timeline

Typed lambda calculi and Curry–Howard · Type theory and…