Proofs, Provenance, and Types for Scientific Knowledge: A Twelve-Lecture Course on the Eigenius Primer

The course is a set of twelve slide decks, 272 slides in all. It teaches how a dependent type theory can check scientific reasoning without erasing how a conclusion was reached. The running example is a published cancer-biology result: the gene WRN is essential in microsatellite-unstable cells. Two independent screens and two rescue analyses give four distinct proofs of the same claim. Mainstream proof assistants treat any two proofs of a statement as equal, so they cannot say which proofs survive when one source is withdrawn. Lectures 2–6 build a small type-checking kernel that keeps proofs distinct: dependent types and universes; untyped, confluent definitional equality; proof irrelevance as an explicit axiom rather than a conversion rule; one subtyping judgment for universes and ontologies; a bidirectional checker that never guesses. Lectures 7–11 extend the kernel in three directions: importing results from external tools such as R pipelines as checked certificates, building on institution theory; recording experimental reports as evidence rather than truth (justification logic), with polynomial-time “what survives if this source is retracted?” queries (provenance semirings); typing open-world, cyclic knowledge-graph records. Lecture 12 proves the system consistent with a stratified set-theoretic model and shows the Lean 4 formalisation. It closes with the full study: 55 of 55 verdicts machine-checked. Each lecture includes proof sketches, code walkthroughs of a reference checker, timed in-class exercises, and all but three include a Lean 4 slide. The course is aimed at final-year computer science and mathematics students with a first course in logic.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24375038
Primary Topic
Logic, programming, and type systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Proofs, Provenance, and Types for Scientific Knowledge: A Twelve-Lecture Course on the Eigenius Primer

Will Hans-Martin
Zenodo (CERN European Organization for Nuclear Research)
Logic, programming, and type systems
article

Proofs, Provenance, and Types for Scientific Knowledge: A Twelve-Lecture Course on the Eigenius Primer

Will Hans-Martin
article en

Abstract

The course is a set of twelve slide decks, 272 slides in all. It teaches how a dependent type theory can check scientific reasoning without erasing how a conclusion was reached. The running example is a published cancer-biology result: the gene WRN is essential in microsatellite-unstable cells. Two independent screens and two rescue analyses give four distinct proofs of the same claim. Mainstream proof assistants treat any two proofs of a statement as equal, so they cannot say which proofs survive when one source is withdrawn. Lectures 2–6 build a small type-checking kernel that keeps proofs distinct: dependent types and universes; untyped, confluent definitional equality; proof irrelevance as an explicit axiom rather than a conversion rule; one subtyping judgment for universes and ontologies; a bidirectional checker that never guesses. Lectures 7–11 extend the kernel in three directions: importing results from external tools such as R pipelines as checked certificates, building on institution theory; recording experimental reports as evidence rather than truth (justification logic), with polynomial-time “what survives if this source is retracted?” queries (provenance semirings); typing open-world, cyclic knowledge-graph records. Lecture 12 proves the system consistent with a stratified set-theoretic model and shows the Lean 4 formalisation. It closes with the full study: 55 of 55 verdicts machine-checked. Each lecture includes proof sketches, code walkthroughs of a reference checker, timed in-class exercises, and all but three include a Lean 4 slide. The course is aimed at final-year computer science and mathematics students with a first course in logic.

Zenodo (CERN European Organization for Nuclear Research)
Logic, programming, and type systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon