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

Linear logic

  • logic
  • type theory

Jean-Yves Girard introduced linear logic in 1987, treating assumptions as resources rather than allowing unrestricted copying and discarding by default. Different connectives and modalities make resource behavior explicit in the logical structure. The approach influenced programming-language systems for ownership, state and protocols. The slogan “exactly once” summarizes an important intuition but not every construction in the full logic, where modalities control reusable resources. Linear and affine disciplines also differ: affine systems permit discarding while restricting duplication. **Timeline anchor:** 1 January 1987 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/Linear_logic).

Sources

Related

On other timelines

Open Linear logic in the timeline