AI Chat AI Image Generator AI Video Text to Speech

Semantics-Preserving DPO-Based Term Graph Rewriting

02/06/2019

∙

by Wolfram Kahl, et al.

∙

∙

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.

Wolfram Kahl
1 publication
Yuhang Zhao
11 publications

page 1

page 2

page 3

page 4

research

∙ 12/22/2022

Towards Mechanised Proofs in Double-Pushout Graph Transformation

We formalise the basics of the double-pushout approach to graph transfor...

0 Robert Söldner, et al. ∙

research

∙ 05/05/2023

Finding the Right Way to Rome: Effect-oriented Graph Transformation

Many applications of graph transformation require rules that change a gr...

0 Jens Kosiol, et al. ∙

research

∙ 12/22/2022

A Foundation for Functional Graph Programs: The Graph Transformation Control Algebra (GTA)

Applications of graph transformation (GT) systems often require control ...

0 Jens H. Weber, et al. ∙

research

∙ 12/14/2022

Verifying term graph optimizations using Isabelle/HOL

Our objective is to formally verify the correctness of the hundreds of e...

0 Brae J. Webb, et al. ∙

research

∙ 05/05/2021

A Generalized Concurrent Rule Construction for Double-Pushout Rewriting

Double-pushout rewriting is an established categorical approach to the r...

0 Jens Kosiol, et al. ∙

research

∙ 08/11/2020

Backjumping is Exception Handling

ISO Prolog provides catch and throw to realise the control flow of excep...

0 Ed Robbins, et al. ∙

research

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

0 Clemens Grabmayer, et al. ∙