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

Russell writes to Frege about his paradox

  • logic

Bertrand Russell identified a contradiction in unrestricted set formation around 1901. Considering the collection of all sets that do not contain themselves leads to a contradiction when asking whether that collection contains itself. The paradox exposed a problem in naive comprehension principles and affected Frege’s foundational system. Subsequent type theories and axiomatic set theories restricted how sets or expressions could be formed. The result did not make every use of sets inconsistent; it showed that apparently natural unrestricted rules needed a more careful foundation. **Timeline anchor:** 16 June 1902 CE. Russell found it in 1901; the letter is dated 16 June 1902. **References:** [Source 1](https://en.wikipedia.org/wiki/Russell's_paradox).

Sources

Related

On other timelines

Open Russell writes to Frege about his paradox in the timeline