Weak Normalization for the Simply-Typed Lambda-Calculus in Twelf (Extended Abstract) (2004)
Cached
Download Links
by
Andreas Abel
| Venue: | In Logical Frameworks and Metalanguages (LFM 04), IJCAR |
| Citations: | 8 - 3 self |
BibTeX
@INPROCEEDINGS{Abel04weaknormalization,
author = {Andreas Abel},
title = {Weak Normalization for the Simply-Typed Lambda-Calculus in Twelf (Extended Abstract)},
booktitle = {In Logical Frameworks and Metalanguages (LFM 04), IJCAR},
year = {2004}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Andreas Abel Department of Computer Science, Chalmers University of Technology Rannvagen 6, SWE-41296 Goteborg, Sweden Abstract. Weak normalization for the simply-typed -calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait's computability method does not seem to be directly usable, a combinatorical proof is adapted and formalized instead.
