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 paradox

  • type theory

Girard’s paradox exposed inconsistency in an early type-theoretic foundation that allowed an excessively unrestricted universe, often summarized as a type of all types. Powerful self-reference through the formation rules made it possible to derive contradiction. The lesson was not that all dependent type theory is inconsistent. Stratified universes and other restrictions distinguish later consistent candidate systems from the problematic formulation. The paradox is a foundational result about precise rules, motivating careful design of what types can contain or quantify over. **Timeline anchor:** 1 January 1972 CE. Year of the thesis. **References:** [Source 1](https://en.wikipedia.org/wiki/System_U).

Sources

Related

On other timelines

Open Girard's paradox in the timeline

Girard's paradox · Type theory and functional programming