Essentials of Term Graph Rewriting
Detlef Plump · Electronic Notes in Theoretical Computer Science · 2002
Term graph rewriting is a model for computing with graphs representing functional expressions. Graphs allow to share common subexpressions which improves the efficiency of conventional term rewriting in space and time. This article reviews essentials of term graph rewriting concerning soundness, completeness, termination and confluence.