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
Cartesian closed categories
category theory
lambda calculus
Joachim Lambek developed categorical connections between typed lambda calculus and cartesian closed categories. Products and function spaces can be interpreted through structural properties of objects and maps, relating syntax to a mathematical semantics. Together with propositions-as-types, this contributes to the Curry–Howard–Lambek perspective linking proofs, programs and categories. The correspondences require specified equivalences and rules; they are not a claim that every category is automatically a programming language. The work supplied a powerful language for comparing logical and computational structure. **Timeline anchor:** 1 January 1972 CE. Approximate: papers from 1968 to 1980. **References:** [Source 1](https://en.wikipedia.org/wiki/Cartesian_closed_category).