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.
@InProceedings{balabonski:LIPIcs.RTA.2012.85, author = {Balabonski, Thibaut}, 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 = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.85}, 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} }
Feedback for Dagstuhl Publishing