Semantics-Preserving DPO-Based Term Graph Rewriting

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...

Full description

Bibliographic Details
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
id doaj-193a0869e78e40a6a5622cfed4aae1bc
record_format Article
spelling doaj-193a0869e78e40a6a5622cfed4aae1bc2020-11-25T01:49:19ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802019-02-01288Proc. TERMGRAPH 2018263710.4204/EPTCS.288.3:5Semantics-Preserving DPO-Based Term Graph RewritingWolfram Kahl0Yuhang Zhao1 McMaster University 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.http://arxiv.org/pdf/1902.02011v1
collection DOAJ
language English
format Article
sources DOAJ
author Wolfram Kahl
Yuhang Zhao
spellingShingle Wolfram Kahl
Yuhang Zhao
Semantics-Preserving DPO-Based Term Graph Rewriting
Electronic Proceedings in Theoretical Computer Science
author_facet Wolfram Kahl
Yuhang Zhao
author_sort Wolfram Kahl
title Semantics-Preserving DPO-Based Term Graph Rewriting
title_short Semantics-Preserving DPO-Based Term Graph Rewriting
title_full Semantics-Preserving DPO-Based Term Graph Rewriting
title_fullStr Semantics-Preserving DPO-Based Term Graph Rewriting
title_full_unstemmed Semantics-Preserving DPO-Based Term Graph Rewriting
title_sort semantics-preserving dpo-based term graph rewriting
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2019-02-01
description 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.
url http://arxiv.org/pdf/1902.02011v1
work_keys_str_mv AT wolframkahl semanticspreservingdpobasedtermgraphrewriting
AT yuhangzhao semanticspreservingdpobasedtermgraphrewriting
_version_ 1725007332720508928

Similar Items