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

Agda 2

  • proof assistants
  • languages

Agda 2, developed through work including Ulf Norell’s research, combines dependent types with functional programming and interactive proof development. Types may mention values, allowing a program’s interface to express properties more precise than a simple distinction between numbers and strings. The checker helps ensure that definitions meet those specifications under the language’s rules. Termination and totality are important when programs serve as proofs, so unrestricted computation and a consistent logical interpretation require different treatment. Agda is both a language and a research platform, with later extensions distinct from its initial release. **Timeline anchor:** 1 January 2007 CE. Year of release. **References:** [Source 1](https://en.wikipedia.org/wiki/Agda_(programming_language)).

Sources

Related

On other timelines

Open Agda 2 in the timeline