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

Girard's System F

  • type theory
  • lambda calculus

Jean-Yves Girard developed System F in his early-1970s work on logic and polymorphism. The calculus permits abstraction over types, making it possible to express functions that operate uniformly across many instantiations. Strong normalization for the typed system provides an important logical property: permitted reductions terminate. This result does not transfer to an arbitrary programming language merely because it supports generics. System F became a central reference for parametric polymorphism and the relationship between typed computation and second-order reasoning. **Timeline anchor:** 1 January 1972 CE. Thesis 1972 (announced 1971). **References:** [Source 1](https://en.wikipedia.org/wiki/System_F), [Source 2](https://en.wikipedia.org/wiki/Jean-Yves_Girard).

Sources

Related

On other timelines

Open Girard's System F in the timeline