Explicit Universes for the Calculus of Constructions (2002)
by
Judicaël Courant
| Venue: | Theorem Proving in Higher Order Logics 2002, Springer LNCS 2410 |
| Citations: | 8 - 0 self |
BibTeX
@INPROCEEDINGS{Courant02explicituniverses,
author = {Judicaël Courant},
title = {Explicit Universes for the Calculus of Constructions},
booktitle = {Theorem Proving in Higher Order Logics 2002, Springer LNCS 2410},
year = {2002},
pages = {115--130},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The implicit universe hierarchy implemented in proof assistants such as Coq and Lego, although really needed, is painful, both for the implementer and the user: it interacts badly with modularity features, errors are difficult to report and to understand. Moreover, typechecking is quite complex.
Citations
| 573 | The Definition of Standard ML (Revised - Milner, Tofte, et al. - 1997 |
| 75 | Ecc: an extended calculus of constructions - Luo - 1989 |
| 58 | An analysis of Girard’s paradox - Coquand - 1985 |
| 38 | and Gérard Huet. The Calculus of Constructions - Coquand - 1988 |
| 32 | Parallel reductions in -calculus - Takahashi - 1993 |
| 28 | Checking Algorithms for Pure Type Systems - Jutting, McKinna, et al. |
| 23 | MC2: A Module Calculus for Pure Type Systems - Courant - 2006 |
| 6 | Type checking, universe polymorphism, and typical ambiguity in the calculus of constructions - Harper, Pollack - 1989 |
