Term graph rewriting is concerned with the representation of functional expressions as
graphs, and the evaluation of these expressions by rule-based graph transformation …

The algebraic approaches to graph transformation are based on the concept of gluing of
graphs, modelled by pushouts in suitable categories of graphs and graph morphisms. This …

The framework of graph transformation combines the potentials and advantages of both,
graphs and rules, to a single computational paradigm. In this paper we present some recent …

The digital transformation of society affects all aspects of human life, offering new
opportunities but also creating challenges and risks. More tasks will be automated using …

Term graph rewriting is a model for computing with graphs representing functional
expressions. Graphs allow to share common subexpressions which improves the efficiency …

We present a categorical characterization of term graphs (ie, finite, directed acyclic graphs
labeled over a signature) that parallels the well-known characterization of terms as arrows of …

A necessary and sufficient condition for termination of graph rewriting systems is
established. Termination is equivalent to the finiteness of all forward closures, being certain …

Term graphs represent functional expressions such that common subexpressions can be
shared, making expression evaluation more efficient than with strings or trees. Rewriting of …

It is well-known that a term rewriting system can be faithfully described by a cartesian 2-
category, where horizontal arrows represent terms, and cells represent rewriting sequences …

Term graph rewriting differs from term rewriting in that common subexpressions can be
shared, improving the efficiency of rewriting in space and time. Moreover, computations by …