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

Monads for functional programming

  • effects
  • languages

Philip Wadler’s work, including The Essence of Functional Programming in 1992, translated monadic structure into a practical way of organizing functional programs with effects. Computations can be composed through operations whose laws support systematic reasoning. The approach built on Moggi’s semantic work and influenced Haskell’s treatment of input/output and other computational patterns. A monad is not itself synonymous with an effect or a global mutable state. Its role is a compositional interface through which different kinds of computation can be expressed consistently. **Timeline anchor:** 1 January 1992 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/Monad_(functional_programming)).

Sources

Related

On other timelines

Open Monads for functional programming in the timeline