  Term graph rewriting is important as "conceptual implementation" of the
execution of functional programs, and of data-flow optimisations in compilers.
One way to define term graph transformation rule application is via the
well-established and intuitively accessible double-pushout (DPO) approach; we
present a new result proving semantics preservation for such DPO-based term
graph rewriting.
