Semantics-Preserving DPO-Based Term Graph Rewriting
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) ap...
Main Authors: | Wolfram Kahl, Yuhang Zhao |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2019-02-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1902.02011v1 |
Similar Items
-
Term Graph Rewriting and Parallel Term Rewriting
by: Andrea Corradini, et al.
Published: (2011-02-01) -
Structured Operational Semantics for Graph Rewriting
by: A. Dorman, et al.
Published: (2012-06-01) -
Structured Operational Semantics for Graph Rewriting
by: Andrei Dorman, et al.
Published: (2011-07-01) -
Dependently-Typed Formalisation of Typed Term Graphs
by: Wolfram Kahl
Published: (2011-02-01) -
Hybrid Consensus Algorithm Based on Modified Proof-of-Probability and DPoS
by: Baocheng Wang, et al.
Published: (2020-07-01)