Confluence of layered rewrite systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Confluence of layered rewrite systems


We investigate the new, Turing-complete class of layered systems, whose lefthand sides of rules can only be overlapped at a multiset of disjoint or equal positions. Layered systems define a natural notion of rank for terms: the maximal number of non-overlapping redexes along a path from the root to a leaf. Overlappings are allowed in finite or infinite trees. Rules may be non-terminating, non-left-linear, or non-right-linear. Using a novel unification technique, cyclic unification, we show that rank non-increasing layered systems are confluent provided their cyclic critical pairs have cyclic-joinable decreasing diagrams.
Fichier principal
Vignette du fichier
CSL-finalversion-150719.pdf (490.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01199062 , version 1 (15-09-2015)
hal-01199062 , version 2 (01-12-2015)



Jiaxiang Liu, Jean-Pierre Jouannaud, Mizuhito Ogawa. Confluence of layered rewrite systems. 24th EACSL Annual Conference on Computer Science Logic (CSL 2015), Sep 2015, Berlin, Germany. pp.423--440, ⟨10.4230/LIPIcs.CSL.2015.423⟩. ⟨hal-01199062v2⟩
392 View
107 Download



Gmail Facebook Twitter LinkedIn More