License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2011.288
URN: urn:nbn:de:0030-drops-33265
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3326/
Felgenhauer, Bertram ;
Zankl, Harald ;
Middeldorp, Aart
Layer Systems for Proving Confluence
Abstract
We introduce layer systems for proving generalizations of the modularity of confluence for first-order rewrite systems. Layer systems specify how terms can be divided into layers. We establish structural conditions on those systems that imply confluence. Our abstract framework covers known results like many-sorted persistence, layer-preservation and currying. We present a counterexample to an extension of the former to order-sorted rewriting and derive new sufficient conditions for the extension to hold.
BibTeX - Entry
@InProceedings{felgenhauer_et_al:LIPIcs:2011:3326,
author = {Bertram Felgenhauer and Harald Zankl and Aart Middeldorp},
title = {{Layer Systems for Proving Confluence}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {288--299},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Supratik Chakraborty and Amit Kumar},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3326},
URN = {urn:nbn:de:0030-drops-33265},
doi = {10.4230/LIPIcs.FSTTCS.2011.288},
annote = {Keywords: Term rewriting, Confluence, Modularity, Persistence}
}
Keywords: |
|
Term rewriting, Confluence, Modularity, Persistence |
Collection: |
|
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011) |
Issue Date: |
|
2011 |
Date of publication: |
|
01.12.2011 |