ELAN for equational reasoning in Coq - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2000

ELAN for equational reasoning in Coq


We describe an interface between \textsf{Coq}, an interactive theorem-prover based on type theory and \textsf{ELAN}, an automated deduction system based on rewriting logic. Our objective is to provide efficient tools to implement decision procedures using equational reasoning in \textsf{Coq}. \textsf{ELAN} is used as a rewrite engine. Reflection is used in \textsf{Coq} to translate back the delegated rewrite computations. A rewriting trace is returned from \textsf{ELAN} and replayed in \textsf{Coq}. Correctness is ensured by this replaying which builds a complete proof-term.
Fichier principal
Vignette du fichier
A00-R-462.pdf (280.69 Ko) Télécharger le fichier

Dates and versions

inria-00107864 , version 1 (19-10-2006)


  • HAL Id : inria-00107864 , version 1


Quang-Huy Nguyen, Cuihtlauac Alvarado. ELAN for equational reasoning in Coq. 2nd Workshop on Logical Frameworks & Metalanguage - LFM'00, J. Despeyroux, Jun 2000, Santa Barbara, USA, 14 p. ⟨inria-00107864⟩
129 View
107 Download


Gmail Facebook Twitter LinkedIn More