Certifying Term Rewriting Proof in ELAN - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

Certifying Term Rewriting Proof in ELAN

Abstract

Term rewriting has been shown to be a good environment for both programming and proving. We consider the proof term of term rewriting and propose a formalism based on the rewriting calculus with explicit substitutions ($\rho\sigma$-calculus). This formalism is helpful in analysing and in debugging rule-based programs. Moreover, term rewriting proofs can be exported to other systems by translating them into the corresponding syntaxes. That is, using a proof checker, one can certify these proofs and vice versa, this method allows us to get term rewriting in proof assistants using an external system. Our method not only works with syntactic term rewriting but also with term rewriting modulo a set of axioms ({\em e.g.} associativity-commutativity).
Fichier principal
Vignette du fichier
A01-R-138.pdf (352.34 Ko) Télécharger le fichier

Dates and versions

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

Identifiers

  • HAL Id : inria-00107875 , version 1

Cite

Quang-Huy Nguyen. Certifying Term Rewriting Proof in ELAN. 2nd International Workshop on Rule-based Programming - RULE'01, Sep 2001, Firenze, Italy, 18 p. ⟨inria-00107875⟩
103 View
51 Download

Share

Gmail Facebook X LinkedIn More