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.RTA.2012.85
URN: urn:nbn:de:0030-drops-34868
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2012/3486/
Balabonski, Thibaut
Axiomatic Sharing-via-Labelling
Abstract
A judicious use of labelled terms makes it possible to bring together the simplicity of term rewriting and the sharing power of graph rewriting: this has been known for twenty years in the particular case of orthogonal first-order systems. The present paper introduces a concise and easily usable axiomatic presentation of sharing-via-labelling techniques that applies to higher-order term rewriting as well as to non-orthogonal term rewriting. This provides a general framework for the sharing of subterms and keeps the formalism as simple as term rewriting.
BibTeX - Entry
@InProceedings{balabonski:LIPIcs:2012:3486,
author = {Thibaut Balabonski},
title = {{Axiomatic Sharing-via-Labelling}},
booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12) },
pages = {85--100},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-38-5},
ISSN = {1868-8969},
year = {2012},
volume = {15},
editor = {Ashish Tiwari},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3486},
URN = {urn:nbn:de:0030-drops-34868},
doi = {10.4230/LIPIcs.RTA.2012.85},
annote = {Keywords: Sharing, Abstract term rewriting, Graphs, Higher order, Non-orthogonality}
}
|
Keywords: |
|
Sharing, Abstract term rewriting, Graphs, Higher order, Non-orthogonality |
|
Collection: |
|
23rd International Conference on Rewriting Techniques and Applications (RTA'12) |
|
Issue Date: |
|
2012 |
|
Date of publication: |
|
29.05.2012 |
