Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Explicit Universes for the Calculus of Constructions
| |
|
Explicit Universes for the Calculus of Constructions
Judicaël Courant7 
| (7) |
Laboratoire de Recherche en Informatique Bât 490, Université Paris Sud, 91405 Orsay Cedex, France |
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, type-checking is quite complex.
We address these issues with a new calculus, the Explicit Polymorphic Extended Calculus of Constructions. EPECC is a conservative
extension of Luo’s ECC with universe variables and explicit universe constraints declarations. EPECC behaves better with respect
to error reporting and modularity than implicit universes, and also enjoys good metatheoretical properties, notably strong
normalization and Church-Rosser properties. Type-inference and type-checking in EPECC are decidable. A prototype implementation
is available.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|