Semantics-Preserving DPO-Based Term Graph Rewriting

02/06/2019
by   Wolfram Kahl, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/26/2017

The Unfolding Semantics of Functional Programs

The idea of using unfolding as a way of computing a program semantics ha...
05/05/2021

A Generalized Concurrent Rule Construction for Double-Pushout Rewriting

Double-pushout rewriting is an established categorical approach to the r...
04/21/2020

Egel – Graph Rewriting with a Twist

Egel is an untyped eager combinator toy language. Its primary purpose is...
06/25/2021

From Linear Term Rewriting to Graph Rewriting with Preservation of Termination

Encodings of term rewriting systems (TRSs) into graph rewriting systems ...
05/22/2021

Normalising Lustre Preserves Security

The synchronous reactive data flow language LUSTRE is an expressive lang...
08/11/2020

Backjumping is Exception Handling

ISO Prolog provides catch and throw to realise the control flow of excep...
02/06/2019

Modeling Terms by Graphs with Structure Constraints (Two Illustrations)

In the talk at the workshop my aim was to demonstrate the usefulness of ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.