Drags: A compositional algebraic framework for graph rewriting

We are interested in a natural generalization of term-rewriting techniques to what we call drags, viz. finite, directed, ordered, rooted multigraphs, each vertex of which is labeled by a function symbol. To this end, we develop a rich algebra of drags that generalizes the familiar term algebra and i...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 777; pp. 204 - 231
Main Authors Dershowitz, Nachum, Jouannaud, Jean-Pierre
Format Journal Article
LanguageEnglish
Published Elsevier B.V 19.07.2019
Elsevier
Subjects
Computer Science
Distributed, Parallel, and Cluster Computing
Drags
Drags
Graphs
symmetric monoidal category
rewriting
Online AccessGet full text
ISSN0304-3975
1879-2294
DOI10.1016/j.tcs.2019.01.029

Cover

More Information
Summary:We are interested in a natural generalization of term-rewriting techniques to what we call drags, viz. finite, directed, ordered, rooted multigraphs, each vertex of which is labeled by a function symbol. To this end, we develop a rich algebra of drags that generalizes the familiar term algebra and its associated rewriting capabilities. Viewing graphs as terms provides an initial building block for rewriting with such graphs, one that should impact the many areas where computations take place on graphs.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2019.01.029