UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Some Properties of Non-Orthogonal Term Graph Rewriting

Clark, D; Kennaway, R; (1995) Some Properties of Non-Orthogonal Term Graph Rewriting. Electronic Notes in Theoretical Computer Science , 2 (C) pp. 36-45. 10.1016/S1571-0661(05)80179-3.

Full text not available from this repository.

Abstract

This paper examines left-linear non-orthogonal term graph rewriting systems that allow asymmetric conflicts between redexes. Using a definition of compatibility of 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 defined and that an associated standardisation theorem can be proved. Second, that a set of events can be associated with a reduction sequence and hence event structures modelling all the possible reduction sequences from a given initial graph can be constructed. © 1995 Elsevier B.V. All rights reserved.

Type: Article
Title: Some Properties of Non-Orthogonal Term Graph Rewriting
DOI: 10.1016/S1571-0661(05)80179-3
UCL classification: UCL > Provost and Vice Provost Offices
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: http://discovery.ucl.ac.uk/id/eprint/619666
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item