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

Hope

  • languages

Hope, developed by Rod Burstall, David MacQueen and Donald Sannella around 1980, helped establish algebraic data types and pattern matching in functional-language design. A programmer could describe structured alternatives and write definitions by cases reflecting those alternatives. This linked the organization of data with the structure of programs and their static checks. The combination became influential in later languages, although related ideas had multiple precursors. Hope’s importance is a concrete language design bringing these mechanisms together, not an exclusive claim to every form of structured data. **Timeline anchor:** 1 January 1980 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/Hope_(programming_language)).

Sources

Related

Open Hope in the timeline

Hope · Type theory and functional programming · Circagraph