7. Proofs
Every sentence in this manual that states a fact is the name of a theorem of the spec, written out as a sentence (underscores become spaces). It is underlined; hovering shows the exact Lean statement and clicking leads to the statement below. The build checks that each such theorem exists in the spec and is proved: no sorry, no axiom beyond propext, Classical.choice and Quot.sound (a red sorry mark and a failing scripts/check.sh otherwise). Each statement is written out below, checked against the spec theorem of that name (same binders, same statement up to reducible unfolding), and links to the proof in the source. The examples are checked by computation in the kernel (decide +kernel) or by evaluating the parser (parse_eval); nothing relies on the compiler.
Where the statements are:
Topic | Page |
|---|---|
null, division, rounding, | |
selectors, windows, calendar | |
| |
comparisons, | |
what | |
what an invariant may use, invariants always hold, lower bounds, groups | |
what an append checks, batches, fast check, rejections, concurrency | |
rule lifetimes, deploy checks, type safety | |
printing and parsing, precedence, literals | |
schemas, valid events, | |
definition files, JSON numbers, dates and timestamps, requests and responses, the API | |
the running examples: folio, account, shift, small histories | |
how the engine and language are built (types, reachable states, parser, wire format) |
What no proof covers is on Foundations.
- 7.1. Statements of Overview
- 7.2. Statements of Events
- 7.3. Statements of Values
- 7.4. Statements of Selectors
- 7.5. Statements of Reading the history
- 7.6. Statements of Conditions
- 7.7. Statements of Preconditions
- 7.8. Statements of Invariants
- 7.9. Statements of Appending
- 7.10. Statements of Deploying
- 7.11. Statements of Grammar
- 7.12. Statements of Views
- 7.13. Statements of Files and requests
- 7.14. Statements of Examples