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
Lambda calculus and combinators
–
era
This band compares lambda calculus and combinatory logic as formal approaches to functions and computation. Lambda abstraction binds variables explicitly, while combinators can express corresponding behavior through application and fixed operators. The traditions developed through several researchers and later informed semantics, implementation and programming style. The chosen bounds are an explanatory grouping, not the period during which these calculi were valid or useful. Their mathematical relationship should also be distinguished from the design choices of any particular modern functional language. **Interval represented:** 1 January 1924 CE to 1 January 1958 CE.