Semantics-Preserving DPO-Based Term Graph Rewriting
Logic in Computer Science
2019-02-07 v1
Abstract
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.
Cite
@article{arxiv.1902.02011,
title = {Semantics-Preserving DPO-Based Term Graph Rewriting},
author = {Wolfram Kahl and Yuhang Zhao},
journal= {arXiv preprint arXiv:1902.02011},
year = {2019}
}
Comments
In Proceedings TERMGRAPH 2018, arXiv:1902.01510