Program extraction from normalization proofs (1993)
Cached
Download Links
- [www4.in.tum.de]
- [www4.informatik.tu-muenchen.de]
- [www.mathematik.uni-muenchen.de]
- [www-compsci.swan.ac.uk]
- [cs.swan.ac.uk]
- DBLP
Other Repositories/Bibliography
| Venue: | Typed Lambda Calculi and Applications, number 664 in Lecture Notes in Computer Science |
| Citations: | 54 - 3 self |
BibTeX
@INPROCEEDINGS{Berger93programextraction,
author = {Ulrich Berger and Stefan Berghofer and Pierre Letouzey and Helmut Schwichtenberg},
title = {Program extraction from normalization proofs},
booktitle = {Typed Lambda Calculi and Applications, number 664 in Lecture Notes in Computer Science},
year = {1993},
pages = {91--106},
publisher = {Springer Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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. 1
