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

Liquid Haskell

  • type theory
  • languages

Liquid Haskell adds refinement-style specifications to Haskell programs, expressing logical predicates alongside ordinary types. Automated reasoning through SMT solving helps check that definitions satisfy the supported predicates and assumptions. The system connects functional programming with verification of properties such as bounds or relationships among values. Its guarantees depend on the logic, treatment of termination, imported specifications and trusted components. It is not the same mechanism as Haskell’s ordinary type inference, nor does adding an annotation automatically establish a property without a successful check. **Timeline anchor:** 1 January 2014 CE. Approximate. **References:** [Source 1](https://en.wikipedia.org/wiki/Refinement_type).

Sources

On other timelines

Open Liquid Haskell in the timeline

Liquid Haskell · Type theory and functional programming