Modeling Terms by Graphs with Structure Constraints (Two Illustrations)

by   Clemens Grabmayer, et al.

In the talk at the workshop my aim was to demonstrate the usefulness of graph techniques for tackling problems that have been studied predominantly as problems on the term level: increasing sharing in functional programs, and addressing questions about Milner's process semantics for regular expressions. For both situations an approach that is based on modeling terms by graphs with structure constraints has turned out to be fruitful. In this extended abstract I describe the underlying problems, give references, provide examples, indicate the chosen approaches, and compare the initial situations as well as the results that have been obtained, and some results that are being developed at present.



page 3


Structure-Constrained Process Graphs for the Process Semantics of Regular Expressions

Milner (1984) introduced a process semantics for regular expressions as ...

Proceedings 11th International Workshop on Computing with Terms and Graphs

Graphs, and graph transformation systems, are used in many areas within ...

Separating Structure from Noise in Large Graphs Using the Regularity Lemma

How can we separate structural information from noise in large graphs? T...

Deterministic Regular Expressions With Back-References

Most modern libraries for regular expression matching allow back-referen...

Semantics-Preserving DPO-Based Term Graph Rewriting

Term graph rewriting is important as "conceptual implementation" of the ...

A Syntactic Model of Mutation and Aliasing

Traditionally, semantic models of imperative languages use an auxiliary ...
This week in AI

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