appendix sectionnotation
Foundational derivations, programs, and proofs
| symbol | meaning | first |
|---|---|---|
| symbol | meaning | first |
| chapter 1 | ||
| height of a derivation; a zero-premise rule has height one | chapter 1 | |
| hypothetical derivability of |
chapter 1 | |
| one small step in the arithmetic fragment | chapter 1 | |
| reflexive transitive closure of arithmetic-fragment steps | chapter 1 | |
| arithmetic-fragment big-step evaluation of |
chapter 1 | |
| one full-language call-by-value small step generated by E-App-L–E-Add-S | chapter 1 | |
| reflexive transitive closure of full-language call-by-value steps | chapter 1 | |
| full-language big-step evaluation of |
chapter 1 | |
| fill the unique hole of evaluation context |
chapter 1 | |
| free term variables of |
chapter 1 | |
| alpha-equivalence of raw named terms; ordinary |
definition 1.53, convention 1.57 | |
| capture-avoiding substitution of term |
chapter 1 | |
| fresh renaming of free |
chapter 1 | |
| abbreviation for |
chapter 2 | |
| compatible proof reduction, distinct from deterministic call-by-value evaluation | chapter 2 | |
| reducibility candidate indexed by simple type |
chapter 2 | |
| maximum reduction height of a strongly normalizing term | chapter 2 | |
| free individual variables of a first-order term, formula, or context | chapter 3 | |
| chapter 3 | ||
| labeled first-order natural-deduction proof-term typing | chapter 3 | |
| universal proof abstraction and instantiation | chapter 3 | |
| existential package with witness |
chapter 3 | |
| existential elimination binding witness |
chapter 3 |