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

Damas–Milner

  • type theory

Luis Damas and Robin Milner’s 1982 work established principal type schemes for the relevant ML type system. Type inference could compute a most general typing from which other permitted typings follow by substitution. This made polymorphic programming more practical without requiring users to annotate every expression. The guarantee concerns a particular discipline of let-polymorphism, not every feature ever added to an ML implementation. Extensions such as unrestricted higher-rank or dependent types change the inference problem and cannot inherit the original theorem automatically. **Timeline anchor:** 1 January 1982 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/Hindley–Milner_type_system).

Sources

Related

On other timelines

Open Damas–Milner in the timeline