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

KRC

  • languages

David Turner developed the Kent Recursive Calculator, KRC, as part of the lazy functional-language line that also includes SASL and Miranda. List comprehensions provided a concise notation for generating and filtering lists from declarative descriptions. The language explored how non-strict evaluation and high-level sequence processing could work together. Its significance is both a usable experimental system and an influence on subsequent language design. Later Haskell comprehensions belong to that broader history rather than being identical to every detail of KRC’s syntax and implementation. **Timeline anchor:** 1 January 1981 CE. Year of release. **References:** [Source 1](https://en.wikipedia.org/wiki/Kent_Recursive_Calculator).

Sources

Related

On other timelines

Open KRC in the timeline