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

Reynolds's polymorphic lambda calculus

  • type theory

John Reynolds independently developed a polymorphic lambda calculus in the early 1970s, presenting it in work on type structure. Like Girard’s System F, it supports abstraction over types, giving a precise setting for uniform polymorphic functions. Reynolds’s broader research connected language design, semantics and reasoning about representation. The independent origins matter historically: a common formal idea arose from related but distinct investigations. Later parametricity results should be treated as further developments, not all collapsed into the first presentation of the calculus. **Timeline anchor:** 1 January 1974 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/System_F), [Source 2](https://en.wikipedia.org/wiki/John_C._Reynolds).

Sources

Related

On other timelines

Open Reynolds's polymorphic lambda calculus in the timeline