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

Lean's mathlib

  • proof assistants

The Lean community’s mathlib project collects formalized mathematics and supporting programming infrastructure in a shared library. Definitions and theorems become reusable components, so a new formalization need not rebuild every prerequisite from the logical foundation. The project’s growth reflects coordinated human work on proofs, interfaces, automation and maintenance. Its contents changed substantially through Lean-version migrations and continued contributions. A library’s size or breadth does not by itself prove every mathematical statement outside it; the significance is the accumulated, checked foundation that enables larger developments. **Timeline anchor:** 1 January 2017 CE. Approximate. **References:** [Source 1](https://en.wikipedia.org/wiki/Lean_(proof_assistant)).

Sources

Related

On other timelines

Open Lean's mathlib in the timeline