Well-founded Path Orderings for Drags - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Well-founded Path Orderings for Drags


The definition herein of the Graph Path Ordering (GPO) on certain graph expressions is inspired by that of the Recursive Path Ordering (RPO), and enjoys all those properties that have made RPO popular, in particular, well-foundedness and monotonicity on variable-free terms. We are indeed interested in a generalization of algebraic expressions called operadic expressions, which are finite graphs each vertex of which is labelled by a function symbol, the arity of which governs the number of vertices it relates to in the graph. These graphs are seen here as terms with sharing and back-arrows. Operadic expressions are themselves multiplied (an associative operation) to form monomials, which are in turn summed up (an associative commutative operation) to form polynomials. Operadic expressions and their polynomials occur in algebraic topology, and in various areas of computer science, notably concurrency and type theory. Rewriting basic operadic expressions is very much like rewriting algebraic expressions, while rewriting their monomials and polynomials is very much like the Groebner basis theory. GPO provides an initial building block for computing with operadic expressions and their polynomials.
Fichier principal
Vignette du fichier
HDRA2016_paper_8.pdf (324.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01330907 , version 1 (13-06-2016)


  • HAL Id : hal-01330907 , version 1


Nachum Dershowitz, Jean-Pierre Jouannaud, Jianqi Li. Well-founded Path Orderings for Drags. Proceedings Higher Dimensional Rewriting and Applications, Jun 2016, Porto, Portugal. ⟨hal-01330907⟩
120 View
62 Download


Gmail Facebook Twitter LinkedIn More