Coq Modulo Theory - Short Paper - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Coq Modulo Theory - Short Paper

Pierre-Yves Strub
  • Function : Author
  • PersonId : 857170
Qian Wang
  • Function : Author
  • PersonId : 872923


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.
Fichier principal
Vignette du fichier
lics-2010.pdf (39.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00497794 , version 1 (05-07-2010)


  • 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⟩
301 View
120 Download


Gmail Facebook X LinkedIn More