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

Combinatory Logic, volume I

  • type theory
  • lambda calculus

Haskell Curry and Robert Feys’s Combinatory Logic, Volume I, published in 1958, systematically presented a field that had developed over several decades. Its treatment made relationships between combinator types and formal logical derivations explicit. The book helped consolidate a technical vocabulary for studying functions, substitution and proof. The correspondence concerns specified logical and type systems, not an assertion that any arbitrary program automatically proves a true statement. Later work extended these relationships to natural deduction and many richer calculi. **Timeline anchor:** 1 January 1958 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/Curry–Howard_correspondence).

Sources

Related

On other timelines

Open Combinatory Logic, volume I in the timeline

Combinatory Logic, volume I · Type theory and functional…