Program extraction from normalization proofs [chapter]

Ulrich Berger
Lecture Notes in Computer Science  
This paper describes formalizations of Tait's normalization proof for the simply typed λ-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 normalization-by-evaluation algorithm. The case study is used to test and compare the program extraction machineries of the three proof assistants in a non-trivial setting.
doi:10.1007/bfb0037100 dblp:conf/tlca/Berger93 fatcat:4pfm6c3u7rbm5huslujnqiyrua