3.3. Key Proof Modules
Module | Theorems | Scope |
|---|---|---|
| 259 theorems + 1,063 guards | Character-to-token correctness for all scanner operations |
| 63 theorems | Valid YAML inputs are accepted |
| 28 theorems | Output corresponds to valid grammar derivations |
| 58 theorems + 63 guards | Parse-emit-parse cycle properties |
| 12 theorems | Scanner + parser pipeline correctness |
| 12 theorems + 64 guards | Bridge between scanner emissions and grammar predicates |
| 12 theorems | Grammar-to-implementation correspondence |
| 50 theorems | Well-formed anchors through entire parser pipeline |
| 57 theorems | Anchor growth and alias resolution |
| 102 theorems | Flow nesting, token preservation, scannable properties |
| 24 theorems | Offset strictly increases on every scanner step |
| Multiple theorems | Simple key lifecycle well-formedness |
| Multiple theorems | Dispatch pipeline preserves all invariants |