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

seL4 is verified

  • proof assistants
  • compilers & implementation

The seL4 project completed a machine-checked functional-correctness proof for a specified microkernel implementation in 2009 using Isabelle/HOL. The proof related executable code to an abstract specification under explicit assumptions. This was a major systems-verification achievement, but it did not verify every application, driver or possible hardware configuration. Trusted components and machine interfaces remain important to interpreting the result. The case demonstrates how formal proof can support a substantial operating-system component while making the boundary of the guarantee explicit. [Project history](https://sel4.systems/About/history.html); [assumptions](https://sel4.systems/Verification/assumptions.html). **Timeline anchor:** 1 January 2009 CE. Year announced. **References:** [Source 1](https://en.wikipedia.org/wiki/L4_microkernel_family).

Sources

On other timelines

Open seL4 is verified in the timeline