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 four colour theorem in Coq

  • proof assistants

Georges Gonthier completed a Coq-based formal proof of the four-color theorem in the 2000s. The theorem concerns coloring planar maps so adjacent regions differ, with four colors sufficient under the standard mathematical formulation. The formal development combined mathematical reduction with computation checked within a proof framework. It addressed concerns about trusting a large case analysis by making the relationship between computations and the theorem explicit. This was later than Appel and Haken’s original computer-assisted proof and should not be presented as the first proof of any kind. **Timeline anchor:** 1 January 2005 CE. Year announced. **References:** [Source 1](https://en.wikipedia.org/wiki/Four_color_theorem).

Sources

Related

On other timelines

Open The four colour theorem in Coq in the timeline