Zugehörigkeit:
Chalmers University of Technology
Datum:
Die, 08/09/2026 - 11:30 - 12:30
When a theorem is formally verified, the promise being made is the de Bruijn criterion: however elaborate the tooling that produced the proof, the result is rechecked by one small program, the kernel, so that trust in a million-line library reduces to trust in a few thousand lines. It is a good argument. It is also a claim about a specific piece of software, and one worth looking at closely.
This talk is a tour of that program: what a kernel has to do, what it deliberately refuses to do, and why the boundary sits where it does.