Skip to Main content Skip to Navigation
Conference papers

Coq without Type Casts: A Complete Proof of Coq Modulo Theory

Abstract : Incorporating extensional equality into a dependent intensional type system such as the Calculus of Constructions provides with stronger type-checking capabilities and makes the proof development closer to intuition. Since strong forms of extensionality lead to undecidable type-checking, a good trade-off is to extend intensional equality with a decidable first-order theory T, as done in CoqMT, which uses matching modulo T for the weak and strong elimination rules, we call these rules T-elimination. So far, type-checking in CoqMT is known to be decidable in presence of a cumulative hierarchy of universes and weak T-elimination. Further, it has been shown by Wang with a formal proof in Coq that consistency is preserved in presence of weak and strong elimination rules, which actually implies consistency in presence of weak and strong T-elimination rules since T is already present in the conversion rule of the calculus. We justify here CoqMT's type-checking algorithm by showing strong normalization as well as the Church-Rosser property of β-reductions augmented with CoqMT's weak and strong T-elimination rules. This therefore concludes successfully the meta-theoretical study of CoqMT.
Document type :
Conference papers
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Pierre-Yves Strub <>
Submitted on : Thursday, December 14, 2017 - 7:00:55 PM
Last modification on : Friday, April 30, 2021 - 9:53:44 AM


Files produced by the author(s)


  • HAL Id : hal-01664457, version 1


Jean-Pierre Jouannaud, Pierre-Yves Strub. Coq without Type Casts: A Complete Proof of Coq Modulo Theory. LPAR-21: 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, May 2017, Maun, Botswana. ⟨hal-01664457⟩



Record views


Files downloads