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

"A Theory of Type Polymorphism in Programming"

  • type theory

Robin Milner’s 1978 paper A Theory of Type Polymorphism in Programming studied the ML typing discipline and an inference algorithm. It established a soundness result connecting accepted types with the absence of specified kinds of runtime type errors in the modeled language. The often-quoted idea that well-typed programs do not go wrong depends on that formal definition of “wrong.” It does not establish total correctness, termination or freedom from every implementation bug. The work made polymorphism and inference practical while giving them a precise theoretical account. **Timeline anchor:** 1 January 1978 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/Hindley–Milner_type_system).

Sources

Related

On other timelines

Open "A Theory of Type Polymorphism in Programming" in the timeline