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

Moggi's monads

  • effects
  • category theory

Eugenio Moggi’s late-1980s work used monads to give mathematical semantics to computations with effects. A distinction between values and computations could account for features such as state, exceptions and continuations within a common categorical framework. The work was initially semantic rather than a tutorial for writing Haskell applications. Later language designs and libraries adapted monadic structure into practical interfaces. A shared abstract pattern does not mean that every effect has identical behavior; it provides laws and composition principles through which different computational mechanisms can be studied. **Timeline anchor:** 1 January 1989 CE. LICS 1989; journal version 1991. **References:** [Source 1](https://en.wikipedia.org/wiki/Monad_(functional_programming)).

Sources

Related

On other timelines

Open Moggi's monads in the timeline