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
Landin's SECD machine
compilers & implementation
lambda calculus
Peter Landin’s 1964 account of expression evaluation introduced the SECD abstract machine, named for its stack, environment, control and dump components. The machine gives an operational description of how expressions and function applications can be evaluated. It separates language meaning from the details of a particular physical processor, making implementations easier to study formally. The model influenced functional-language implementation and abstract-machine design. It is a semantic and implementation tool, not a claim that later hardware processors literally contain four components bearing those names. **Timeline anchor:** 1 January 1964 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/SECD_machine), [Source 2](https://en.wikipedia.org/wiki/Peter_Landin).