Explicit Universes for the Calculus of Constructions

  • Judicaël Courant
Conference paper

DOI: 10.1007/3-540-45685-6_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2410)
Cite this paper as:
Courant J. (2002) Explicit Universes for the Calculus of Constructions. In: Carreño V.A., Muñoz C.A., Tahar S. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2002. Lecture Notes in Computer Science, vol 2410. Springer, Berlin, Heidelberg


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Judicaël Courant
    • 1
  1. 1.Laboratoire de Recherche en Informatique Bât 490Université Paris SudOrsay CedexFrance

Personalised recommendations