{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:14:28Z","timestamp":1761610468853,"version":"build-2065373602"},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6784,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1995]]},"DOI":"10.1016\/s1571-0661(05)80179-3","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"36-45","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Some Properties of Non-Orthogonal Term Graph Rewriting"],"prefix":"10.1016","volume":"2","author":[{"given":"David","family":"Clark","sequence":"first","affiliation":[]},{"given":"Richard","family":"Kennaway","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80179-3_BIB1","series-title":"volume 103 of Studies in Logic and the Foundations of Mathematics. B.V., P.O. Box 1991, 1000 BZ Amsterdam","article-title":"The Lambda Calculus","author":"Barendregt","year":"1984"},{"key":"10.1016\/S1571-0661(05)80179-3_BIB2","first-page":"169","article-title":"Computational semantics of term rewriting systems","volume":"5","author":"Boudol","year":"1985"},{"key":"10.1016\/S1571-0661(05)80179-3_BIB3","article-title":"Term rewriting, in parallel","author":"Corradini","year":"1994","journal-title":"Unpublished draft, available by application to the author at andrea@DI.UniPi.IT"},{"key":"10.1016\/S1571-0661(05)80179-3_BIB4","series-title":"Seventh annual IEEE Symposium on Logic in Computer Science","article-title":"An abstract standardisation theorem","author":"Gonthier","year":"1992"},{"key":"10.1016\/S1571-0661(05)80179-3_BIB5","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent reductions: abstract properties and applications to term rewriting systems","volume":"27","author":"Huet","year":"1980","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S1571-0661(05)80179-3_BIB6","series-title":"Computational Logic: Essays in Honor of Alan Robinson","first-page":"394","article-title":"Computations in orthogonal rewriting systems: I and ii","author":"Huet","year":"1991"},{"key":"10.1016\/S1571-0661(05)80179-3_BIB7","series-title":"Term Graph Rewriting, theory and practice","first-page":"141","article-title":"Event structures and orthogonal term graph rewriting","author":"Kennaway","year":"1993"},{"key":"10.1016\/S1571-0661(05)80179-3_BIB8","series-title":"International Workshop on Graph Grammars and their Application to Computer Science, number 532 in Lecture Notes in Computer Science","first-page":"490","article-title":"Graph rewriting in some categories of partial morphisms","author":"Kennaway","year":"1991"},{"key":"10.1016\/S1571-0661(05)80179-3_BIB9","article-title":"On the nature of events","volume":"629","author":"Pinna","year":"1992"},{"key":"10.1016\/S1571-0661(05)80179-3_BIB10","unstructured":"G. Winskel. Event structures. Technical Report 95, University of Cambridge Computer Laboratory, July 1986."},{"key":"10.1016\/S1571-0661(05)80179-3_BIB11","series-title":"Advances in Petri Nets, 1986, Part II, number 255 in Lecture Notes in Computer Science","article-title":"Event structures","author":"Winskel","year":"1987"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105801793?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105801793?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:50Z","timestamp":1761610070000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105801793"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":11,"alternative-id":["S1571066105801793"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80179-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Some Properties of Non-Orthogonal Term Graph Rewriting","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80179-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}