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
The Kleene–Rosser paradox
lambda calculus
logic
Stephen Kleene and J. B. Rosser demonstrated inconsistency in Church’s original foundational system in the 1930s. The system combined computational and logical principles strongly enough to admit a contradiction. The result prompted a distinction between the inconsistent logical foundation and the pure lambda calculus as a useful theory of functions. Later typed systems imposed different rules to obtain suitable logical properties. The paradox illustrates why the power to express self-reference must be examined through exact formation and inference rules, not only through appealing notation. **Timeline anchor:** 1 January 1935 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/Kleene–Rosser_paradox).