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

LCF

  • proof assistants

Robin Milner’s LCF work developed an interactive theorem-proving approach in which theorems are represented by an abstract data type. Only trusted primitive inference operations can construct values of that type, while more elaborate proof procedures combine those operations. This architecture separates flexible automation from the small core responsible for logical soundness. ML originated as a language for organizing such proof procedures. The LCF tradition influenced multiple later provers, but sharing the architecture does not mean that all of them use the same logic or implementation. **Timeline anchor:** 1 January 1972 CE. Stanford LCF 1972; Edinburgh LCF 1979. **References:** [Source 1](https://en.wikipedia.org/wiki/Logic_for_Computable_Functions), [Source 2](https://en.wikipedia.org/wiki/Robin_Milner).

Sources

Related

  • ML

On other timelines

Open LCF in the timeline