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

The ML family and polymorphism

–

  • era

This band follows ML from its theorem-proving origins toward polymorphic inference and Standard ML’s formal language definition. Theorem procedures, abstract types, higher-order functions and reusable modules helped connect logical assurance with practical programming. Later family members adopted different runtime and interoperability goals, so a shared ancestry does not imply complete compatibility. The chosen bounds highlight a period of consolidation rather than a completed lifetime for ML. The continuing tradition includes OCaml, F# and other systems with their own subsequent histories. **Interval represented:** 1 January 1972 CE to 1 January 1996 CE.

Open The ML family and polymorphism in the timeline