Axiomatic Sharing-via-Labelling

Author Thibaut Balabonski

Thumbnail PDF


  • Filesize: 0.55 MB
  • 16 pages

Document Identifiers

Author Details

Thibaut Balabonski

Cite AsGet BibTex

Thibaut Balabonski. Axiomatic Sharing-via-Labelling. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 85-100, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)


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.
  • Sharing
  • Abstract term rewriting
  • Graphs
  • Higher order
  • Non-orthogonality


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads