Skip to Main content Skip to Navigation
Conference papers

Coq Modulo Theory - Short Paper

Pierre-yves Strub 1 Qian Wang 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Pierre-Yves Strub Connect in order to contact the contributor
Submitted on : Monday, July 5, 2010 - 11:51:58 PM
Last modification on : Friday, February 4, 2022 - 3:13:47 AM
Long-term archiving on: : Thursday, October 7, 2010 - 12:17:07 PM


Files produced by the author(s)


  • HAL Id : inria-00497794, version 1



Pierre-yves Strub, Qian Wang. Coq Modulo Theory - Short Paper. Logic In Computer Science (LICS 2010), Jul 2010, Edimbourg, United Kingdom. ⟨inria-00497794⟩



Record views


Files downloads