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

OCaml

  • languages

OCaml emerged from the Caml line of ML-family languages, adding object-oriented facilities alongside functional programming and efficient compilation. Static type inference, algebraic data types, pattern matching and modules support structured programs while allowing imperative features where useful. The name’s “Objective” component reflects its object extensions, not a rejection of the functional core. OCaml became useful for compilers, analysis tools and other systems requiring expressive abstractions with practical performance. Its initial release should be distinguished from later runtime redesigns such as OCaml 5. **Timeline anchor:** 1 January 1996 CE. Year of first release. **References:** [Source 1](https://en.wikipedia.org/wiki/OCaml).

Sources

Related

  • ML

Open OCaml in the timeline