Rewriting modulo in Deduction modulo - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

Rewriting modulo in Deduction modulo

Résumé

We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions and predicates defined by higher-order rewrite rules. In a previous work, we defined general syntactic conditions based on the notion of computable closure for ensuring the termination of the combination of rewriting and beta-reduction. Here, we show that this result is preserved when considering rewriting modulo a set of equations if the equivalence classes generated by these equations are finite, the equations are linear and satisfy general syntactic conditions also based on the notion of computable closure. This includes equations like associativity and commutativity, and provides an original treatment of termination modulo equations.
Fichier principal
Vignette du fichier
main.pdf (259.88 Ko) Télécharger le fichier

Dates et versions

inria-00105625 , version 1 (11-10-2006)

Identifiants

Citer

Frédéric Blanqui. Rewriting modulo in Deduction modulo. Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Jun 2003, Valencia, Spain. ⟨inria-00105625⟩
68 Consultations
110 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More