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 single-pushout approach to graph transformation interprets a double-pushout
transformation rule of the classical algebraic approach which consists of two total graph …

This paper tries to explain why and how category theory is useful in computing science, by
giving guidelines for applying seven basic categorical concepts: category, functor, natural …

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 …

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 an equational framework for term graph rewriting with cycles. The usual notion
of homomorphism is phrased in terms of the notion of bisimulation, which is well-known in …

On the adequacy of graph rewriting for simulating term rewriting Page 1 On for JR the Adequacy
of Graph Rewriting Simulating Term Rewriting KENNAWAY University of East Anglia and JW …

We present a definition of term graph rewriting as the taking of a pushout in a category of
partial morphisms, adapting the rather ad hoc definitions we gave in [Ken87] so as to use a …

Jungles are acyclic hypergraphs which represent sets of terms such that common subterms
can be shared. Term rewrite rules are translated into jungle évaluation rules which …

Map L-systems have been successfully applied in the past decade to the study of cell
division patterns and plant morphogenesis. They are used to describe the spatial-temporal …