Semantics-Preserving DPO-Based Term Graph Rewriting

Wolfram Kahl
(McMaster University)
Yuhang Zhao
(McMaster University)

Term graph rewriting is important as "conceptual implementation" of the execution of functional programs, and of data-flow optimisations in compilers. One way to define term graph transformation rule application is via the well-established and intuitively accessible double-pushout (DPO) approach; we present a new result proving semantics preservation for such DPO-based term graph rewriting.

In Maribel Fernández and Ian Mackie: Proceedings Tenth International Workshop on Computing with Terms and Graphs (TERMGRAPH 2018), Oxford, UK, 7th July 2018, Electronic Proceedings in Theoretical Computer Science 288, pp. 26–37.
Published: 6th February 2019.

ArXived at: http://dx.doi.org/10.4204/EPTCS.288.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org