License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2015.423
URN: urn:nbn:de:0030-drops-54293
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5429/
Liu, Jiaxiang ;
Jouannaud, Jean-Pierre ;
Ogawa, Mizuhito
Confluence of Layered Rewrite Systems
Abstract
We investigate a new, Turing-complete class of layered systems, whose linearized lefthand sides of rules can only be overlapped at the root position. Layered systems define a natural notion of rank for terms: the maximal number of 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.
BibTeX - Entry
@InProceedings{liu_et_al:LIPIcs:2015:5429,
author = {Jiaxiang Liu and Jean-Pierre Jouannaud and Mizuhito Ogawa},
title = {{Confluence of Layered Rewrite Systems}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {423--440},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Stephan Kreutzer},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5429},
URN = {urn:nbn:de:0030-drops-54293},
doi = {10.4230/LIPIcs.CSL.2015.423},
annote = {Keywords: Layers, confluence, decreasing diagrams, critical pairs, cyclic unification}
}
|
Keywords: |
|
Layers, confluence, decreasing diagrams, critical pairs, cyclic unification |
|
Collection: |
|
24th EACSL Annual Conference on Computer Science Logic (CSL 2015) |
|
Issue Date: |
|
2015 |
|
Date of publication: |
|
07.09.2015 |
