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 types in GHC

  • type theory
  • languages

GHC 9.0 introduced the LinearTypes extension, based on the Linear Haskell design. Function arrows can specify how an argument is consumed, expressing a controlled use discipline within an existing higher-order polymorphic language. The design supports applications such as resource protocols and pure interfaces to internally mutable data. It does not require every Haskell value or function to become linear, and the precise guarantee concerns consumption in the language’s semantics rather than a naive count of textual variable occurrences. [Design paper](https://arxiv.org/abs/1710.09756). **Timeline anchor:** 1 February 2021 CE. GHC 9.0, February 2021. **References:** [Source 1](https://en.wikipedia.org/wiki/Substructural_type_system).

Sources

Related

On other timelines

Open Linear types in GHC in the timeline