Reduction Operators and Completion of Rewriting Systems - Inria - Institut national de recherche en sciences et technologies du numérique
Journal Articles Journal of Symbolic Computation Year : 2017

Reduction Operators and Completion of Rewriting Systems

Abstract

We propose a functional description of rewriting systems where reduction rules are represented by linear maps called reduction operators. We show that reduction operators admit a lattice structure. Using this structure we define the notions of confluence and of Church-Rosser property. We show that these notions are equivalent. We give an algebraic formulation of completion and show that such a completion exists using the lattice structure. We interpret the confluence for reduction operators in terms of Gröbner bases. Finally, we introduce generalised reduction operators relative to non totally ordered sets.
Fichier principal
Vignette du fichier
Reduction_operators_and_completion_of_rewriting_systems.pdf (357.86 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01325907 , version 1 (02-06-2016)
hal-01325907 , version 2 (20-02-2017)

Identifiers

Cite

Cyrille Chenavier. Reduction Operators and Completion of Rewriting Systems. Journal of Symbolic Computation, In press. ⟨hal-01325907v2⟩
360 View
213 Download

Altmetric

Share

More