Formalization of termination of Gödel's System T
- Rocq Prover 99.1%
- Makefile 0.9%
| .github/workflows | ||
| .gitignore | ||
| _CoqProject | ||
| Examples.v | ||
| Extraction.v | ||
| Makefile | ||
| README.md | ||
| Reflect.v | ||
| stlc.v | ||
| SystemT.v | ||
Totality of Gödel's System T
Formalization of Tait's proof of the totality of Gödel's System T using logical relations and hereditary termination in Coq.
Based on development presented by Bob Harper at OPLSS 2016.