Some Properties of Non-Orthogonal Term Graph Rewriting

David Clark, Richard Kennaway
1995 Electronical Notes in Theoretical Computer Science  
This paper examines left-linear non-orthogonal term graph rewriting systems that allow asymmetric con icts between redexes. Using a de nition of compatibility o f sequences based on Boudol's work on the semantics of term rewriting, it shows that two properties associated with functional languages are true of such graph rewriting systems. First, that a notion of standard computation can be de ned and that an associated standardisation theorem can be proved. Second, that a set of events can be
more » ... ociated with a reduction sequence and hence event structures modelling all the possible reduction sequences from a given initial graph can be constructed.
doi:10.1016/s1571-0661(05)80179-3 fatcat:3kvkhqf27ndwditic5miyzimhi