Universe Polymorphism in Coq - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Universe Polymorphism in Coq


Universes are used in Type Theory to ensure consistency by checking that definitions are well-stratified according to a certain hierarchy. In the case of the Coq proof assistant, based on the predicative Calculus of Inductive Constructions (pCIC), this hierachy is built from an impredicative sort Prop and an infinite number of predicative Type_i universes. A cumulativity relation represents the inclusion order of uni- verses in the core theory. Originally, universes were thought to be floating levels, and definitions to implicitly constrain these levels in a consistent manner. This works well for most theories, however the globality of levels and constraints precludes generic constructions on universes that could work at different levels. Universe polymorphism extends this setup by adding local bindings of universes and constraints, supporting generic definitions over universes, reusable at different levels. This provides the same kind of code reuse facilities as ML-style parametric polymorphism. However, the structure and hierarchy of universes is more complex than bare polymorphic type variables. In this paper, we introduce a conservative extension of pCIC supporting universe polymorphism and treating its whole hierarchy. This new design supports typical ambiguity and implicit polymorphic generalization at the same time, keeping it mostly transparent to the user. Benchmarking the implementation as an extension of the Coq proof assistant on real-world examples gives encouraging results.
No file

Dates and versions

hal-00974721 , version 1 (07-04-2014)


  • HAL Id : hal-00974721 , version 1


Matthieu Sozeau, Nicolas Tabareau. Universe Polymorphism in Coq. Interactive Theorem Proving, Jul 2014, Vienna, Austria. ⟨hal-00974721⟩
259 View
0 Download


Gmail Facebook X LinkedIn More