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

Howard's "formulae-as-types"

  • type theory
  • logic

William Howard’s 1969 manuscript related natural-deduction proofs to typed lambda terms. Propositions correspond to types, proofs to terms, and proof normalization to computational reduction within the matched systems. The correspondence extended earlier observations associated with Curry, giving a precise account of why constructing a program of a type can amount to establishing a proposition. It does not identify every arbitrary program with a valid proof: the logical interpretation depends on the calculus and its restrictions. The manuscript circulated before its eventual publication. **Timeline anchor:** 1 January 1969 CE. Circulated in 1969; published in 1980. **References:** [Source 1](https://en.wikipedia.org/wiki/Curry–Howard_correspondence).

Sources

Related

On other timelines

Open Howard's "formulae-as-types" in the timeline