Skip to Main content Skip to Navigation
Conference papers

Coq Modulo Theory

Pierre-yves Strub 1 
1 FORMES - Formal Methods for Embedded Systems
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
Abstract : Coq Modulo Theory (CoqMT) is an extension of the Coq proof assistant incorporating, in its computational mechanism, validity entailment for user-defined first-order equational theories. Such a mechanism strictly enriches the system (more terms are typable), eases the use of dependent types and provides more automation during the development of proofs. CoqMT improves over the Calculus of Congruent Inductive Constructions by getting rid of various restrictions and simplifying the type-checking algorithm and the integration of first-order decision procedures. We present here CoqMT, and outline its meta-theoretical study. We also give a brief description of our CoqMT implementation.
Document type :
Conference papers
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Pierre-Yves Strub Connect in order to contact the contributor
Submitted on : Monday, July 5, 2010 - 4:55:04 AM
Last modification on : Friday, February 4, 2022 - 3:13:16 AM
Long-term archiving on: : Thursday, October 7, 2010 - 11:51:24 AM


Files produced by the author(s)




Pierre-yves Strub. Coq Modulo Theory. 19th EACSL Annual Conference on Computer Science Logic, Aug 2010, Brno, Czech Republic. pp.529--543, ⟨10.1007/978-3-642-15205-4_40⟩. ⟨inria-00497404⟩



Record views


Files downloads