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

Curry notices formulas are types

  • type theory
  • logic

Haskell Curry observed in the 1930s that type schemes for combinators resemble formulas in implicational logic. A combinator’s well-typed construction could correspond to a derivation of a logical proposition. This was an early stage of the correspondence later associated with Curry and Howard. The modern account connects richer proof systems, lambda terms and normalization, developments not all present in the initial observation. The historical importance is the recognition that typing and logical provability can share a precise structure rather than merely look similar informally. **Timeline anchor:** 1 January 1934 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/Curry–Howard_correspondence).

Sources

Related

On other timelines

Open Curry notices formulas are types in the timeline