Drag Rewriting
Nachum Dershowitz, Jean-Pierre Jouannaud, Fernando Orejas
TL;DR
This work introduces the Drag Model, a powerful algebraic framework for graph rewriting based on drags—finite directed rooted labeled ordered multisgraphs with roots and sprouts. By defining a rich algebra with sum, product, and a wiring-based composition, the authors unify term rewriting, dag rewriting, and general graph rewriting, while enabling sharing and cloning and avoiding dangling edges. They develop a full theory of drag morphisms, coherence, decomposition into atomic drags, and a rewriting calculus with congruences, rewriting extensions, and root-maps, including a categorical interpretation and a detailed comparison with DPO and term-graph approaches. The framework offers a flexible, scalable alternative to traditional graph-rewriting formalisms, with potential impact on modeling sharing, pattern matching, and non-linear rewriting in a wide range of computational settings.
Abstract
We present a new and powerful algebraic framework for graph rewriting, based on drags, a class of graphs enjoying a novel composition operator. Graphs are embellished with roots and sprouts, which can be wired together to form edges. Drags enjoy a rich algebraic structure with sums and products. Drag rewriting naturally extends graph rewriting, dag rewriting, and term rewriting models.
