Program extraction from normalization proofs
Résumé
This paper describes formalizations of Tait's normalization proof for the simply typed lambda-calculus in the proof assistants Minlog, Coq and Isabelle/Hol. From the formal proofs programs are machine-extracted that implement variants of the well-known nbe algorithm. The case study is used to test and compare the program extraction machineries of the three proof assistants in a non-trivial setting.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...