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

ML

  • languages
  • type theory

ML originated as a metalanguage for the LCF theorem-proving environment. It let users write proof procedures while a type discipline and abstract theorem representation helped preserve the boundary around trusted inference. Polymorphism, type inference, exceptions and higher-order functions made it useful beyond its original purpose. The subsequent ML family includes Standard ML, OCaml and F#, which differ in syntax, modules, runtime and extensions. The origin therefore explains a common tradition without making those later languages interchangeable. **Timeline anchor:** 1 January 1973 CE. Approximate: developed from 1973. **References:** [Source 1](https://en.wikipedia.org/wiki/ML_(programming_language)).

Sources

Related

On other timelines

Open ML in the timeline