Transitive term graph rewriting

R. Banach

doi:10.1016/S0020-0190(96)00150-0

Transitive term graph rewriting

Research output: Contribution to journal › Article › peer-review

Abstract

A version of generalised term graph rewriting is presented in which redirections are interpreted transitively. It is shown that the new semantics enjoy enhanced properties regarding ease of implementation on distributed machines compared with conventional semantics because of the Church-Rosser properties of transitive redirections. Furthermore, the good properties of orthogonal systems are largely retained.

Original language	English
Pages (from-to)	109-114
Number of pages	5
Journal	Information Processing Letters
Volume	60
Issue number	3
DOIs	https://doi.org/10.1016/S0020-0190(96)00150-0
Publication status	Published - 11 Nov 1996

Keywords

DACTL
Distributed computing
MONSTR
Packet store rewriting
Programming languages
Term graph rewriting
Transitive redirections

Access to Document

10.1016/S0020-0190(96)00150-0

Cite this

@article{f30ba71aeb53480082df82301accf386,

title = "Transitive term graph rewriting",

abstract = "A version of generalised term graph rewriting is presented in which redirections are interpreted transitively. It is shown that the new semantics enjoy enhanced properties regarding ease of implementation on distributed machines compared with conventional semantics because of the Church-Rosser properties of transitive redirections. Furthermore, the good properties of orthogonal systems are largely retained.",

keywords = "DACTL, Distributed computing, MONSTR, Packet store rewriting, Programming languages, Term graph rewriting, Transitive redirections",

author = "R. Banach",

year = "1996",

month = nov,

day = "11",

doi = "10.1016/S0020-0190(96)00150-0",

language = "English",

volume = "60",

pages = "109--114",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier BV",

number = "3",

}

TY - JOUR

T1 - Transitive term graph rewriting

AU - Banach, R.

PY - 1996/11/11

Y1 - 1996/11/11

N2 - A version of generalised term graph rewriting is presented in which redirections are interpreted transitively. It is shown that the new semantics enjoy enhanced properties regarding ease of implementation on distributed machines compared with conventional semantics because of the Church-Rosser properties of transitive redirections. Furthermore, the good properties of orthogonal systems are largely retained.

AB - A version of generalised term graph rewriting is presented in which redirections are interpreted transitively. It is shown that the new semantics enjoy enhanced properties regarding ease of implementation on distributed machines compared with conventional semantics because of the Church-Rosser properties of transitive redirections. Furthermore, the good properties of orthogonal systems are largely retained.

KW - DACTL

KW - Distributed computing

KW - MONSTR

KW - Packet store rewriting

KW - Programming languages

KW - Term graph rewriting

KW - Transitive redirections

U2 - 10.1016/S0020-0190(96)00150-0

DO - 10.1016/S0020-0190(96)00150-0

M3 - Article

SN - 0020-0190

VL - 60

SP - 109

EP - 114

JO - Information Processing Letters

JF - Information Processing Letters

IS - 3

ER -

Transitive term graph rewriting

Abstract

Keywords

Access to Document

Fingerprint

Cite this