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 lambda cube

  • type theory

Henk Barendregt’s lambda cube organizes eight related typed lambda calculi through three kinds of dependency. The dimensions distinguish allowing terms to depend on types, types on types, and types on terms, starting from a simply typed base. This framework makes relationships among polymorphism, type operators and dependent types explicit. It is a classification of particular calculi, not a map containing every possible type theory or language extension. Its value is explanatory: seemingly different systems can be compared through controlled changes in their formation rules. **Timeline anchor:** 1 January 1991 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/Lambda_cube), [Source 2](https://en.wikipedia.org/wiki/Henk_Barendregt).

Sources

On other timelines

Open The lambda cube in the timeline