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
Effect handlers
effects
Gordon Plotkin and Matija Pretnar developed handlers for algebraic effects as a generalization of exception handling. An operation can describe a computational effect, while a handler supplies its interpretation and may control how the suspended computation continues. This separates the declaration of an effectful action from one particular implementation of that action. The approach supports modular treatments of state-like behavior, nondeterminism and other effects within suitable languages. Specific implementations differ in continuation discipline and typing, so the original theory should not be equated with every later feature called an effect handler. **Timeline anchor:** 1 January 2009 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/Effect_system).