Banach, R. MONSTR V – transitive coercing semantics and the Church-Rosser property. (English) Zbl 0960.68083 J. UCS 3, No. 12, 1283-1336 (1997). Summary: The transitive coercing semantic model for the execution of the MONSTR generalised term graph rewriting language is defined. Of all the operational semantics for MONSTR that one might consider, this one has the cleanest properties. Under intuitively obvious conditions for executions involving redexes permitted to overlap sufficiently to allow the programming of deterministic synchronisations, and despite the failure of exact subcommutativity, a Church-Rosser theorem is proved to hold up to markings and garbage. Cited in 1 Document MSC: 68Q42 Grammars and rewriting systems 68Q55 Semantics in the theory of computing Keywords:transitive coercing semantic model; MONSTR; Church-Rosser theorem PDFBibTeX XMLCite \textit{R. Banach}, J. UCS 3, No. 12, 1283--1336 (1997; Zbl 0960.68083) Full Text: Link