MONSTR V - Transitive Coercing Semantics and the Church-Rosser Property
| dc.creator | Banach,Richard | |
| dc.date | 1997 | |
| dc.date.accessioned | 2024-02-06T12:49:10Z | |
| dc.date.available | 2024-02-06T12:49:10Z | |
| dc.description | 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 on e might consider, this one has the cleanest properties. Under intuitively obvious conditions fo r 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. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-003-12-1283 | |
| dc.identifier | https://lib.jucs.org/article/27443/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/7272 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 3(12): 1283-1336 | |
| dc.title | MONSTR V - Transitive Coercing Semantics and the Church-Rosser Property | |
| dc.type | Research Article |