EQUATIONAL TERM GRAPH REWRITING

1 January 1996

journal article
Published by SAGE Publications in Fundamenta Informaticae

Vol. 26 (3,4) , 207-240
https://doi.org/10.3233/fi-1996-263401

Abstract

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 process algebra and concurrency theory. Specifically, a homomorphism i

Keywords

EQUATIONAL LOGIC
USUAL NOTION
COMPLETE LATTICE
RESTRICTED COPYING FACILITY
TERM GRAPH
EQUATIONAL TERM GRAPH
FUNCTIONAL BISIMULATION
HIDDEN NODE
GENERAL FRAMEWORK
BISIMILARITY CLASS
EQUATIONAL FRAMEWORK
ORTHOGONAL TERM GRAPH
EQUATIONAL TERM GRAPH REWRITING
CONFLUENCE
BISIMULATION

This publication has 0 references indexed in Scilit: