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

The Feit–Thompson theorem in Coq

  • proof assistants

Georges Gonthier and a large team completed a Coq formalization of the Feit–Thompson odd-order theorem in 2012. The theorem states that every finite group of odd order is solvable, a major result in finite-group theory. Formalization required substantial algebraic libraries and careful reconstruction of arguments, not merely loading the original paper into a checker. It demonstrated that proof-assistant methods could handle a deep, extended mathematical development. The original theorem and its later formal verification are distinct achievements with different dates and contributors. **Timeline anchor:** 1 September 2012 CE. Announced September 2012. **References:** [Source 1](https://en.wikipedia.org/wiki/Feit–Thompson_theorem).

Sources

Related

On other timelines

Open The Feit–Thompson theorem in Coq in the timeline