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

Miranda

  • languages

David Turner introduced Miranda in the 1980s as a non-strict, purely functional language with polymorphic static types, algebraic data types and pattern matching. It continued a line of work through SASL and KRC and influenced teaching and research in lazy functional programming. Miranda was a major influence on Haskell, but Haskell’s design also drew from a wider community and made its own choices. The relationship is one of language ideas and practice, not simply a renaming of the same implementation or an identity of every feature. **Timeline anchor:** 1 January 1985 CE. Year of first release. **References:** [Source 1](https://en.wikipedia.org/wiki/Miranda_(programming_language)).

Sources

Related

On other timelines

Open Miranda in the timeline