The Semi-Full Closure of Pure Type Systems (1998)
by
Gilles Barthe
| Venue: | Proceedings of MFCS’98, volume 1450 of Lecture Notes in Computer Science |
| Citations: | 4 - 1 self |
BibTeX
@INPROCEEDINGS{Barthe98thesemi-full,
author = {Gilles Barthe},
title = {The Semi-Full Closure of Pure Type Systems},
booktitle = {Proceedings of MFCS’98, volume 1450 of Lecture Notes in Computer Science},
year = {1998},
pages = {316--325},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We show that every functional Pure Type System may be extended to a semi-full Pure Type System. Moreover, the extension is conservative and preserves weak normalization. Based on these results, we give a new, conceptually simple type-checking algorithm for functional Pure Type Systems. 1
Citations
| 474 | Lambda Calculi with Types - Barendregt - 1992 |
| 65 | The Theory of LEGO: A Proof Checker for the Extended Calculus of Constructions - Pollack - 1994 |
| 37 | Henk: a typed intermediate language - Jones, Meijer - 1997 |
| 28 | Checking Algorithms for Pure Type Systems - Jutting, McKinna, et al. |
| 15 | Normalisation in LAMBDA CALCULUS and its relation to type inference - Severi - 1996 |
| 6 | A typechecker for bijective pure type systems - Poll - 1993 |
| 5 | Typechecking in pure type systems - Pollack - 1992 |
| 3 | Type-checking injective pure type systems - Barthe - 1999 |
