{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:45:04Z","timestamp":1762458304682},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10790,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1984]]},"DOI":"10.1016\/0304-3975(84)90021-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"1-24","source":"Crossref","is-referenced-by-count":59,"title":["On graph rewritings"],"prefix":"10.1016","volume":"32","author":[{"given":"Jean Claude","family":"Raoult","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(84)90021-5_BIB1","article-title":"The Lambda Calculus, Its Syntax and Semantics","volume":"103","author":"Barendregt","year":"1981"},{"key":"10.1016\/0304-3975(84)90021-5_BIB2","series-title":"Programming Languages and Their Compilers","author":"Cocke","year":"1970"},{"key":"10.1016\/0304-3975(84)90021-5_BIB3","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1109\/SWAT.1973.11","article-title":"Graph grammars: An algebraic approach","author":"Ehrig","year":"1973","journal-title":"Proc. 14th Ann. IEEE Symp. on Switching and Automata Theory"},{"issue":"4","key":"10.1016\/0304-3975(84)90021-5_BIB4","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent reductions, abstract properties and application to term rewriting systems","volume":"27","author":"Huet","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(84)90021-5_BIB5","article-title":"Simple word problems in universal algebras","author":"Knuth","year":"1970"},{"key":"10.1016\/0304-3975(84)90021-5_BIB6","series-title":"Th\u00e8se d'\u00e9tat","article-title":"R\u00e9ductions correctes et optimales dans le lambda-calcul","author":"L\u00e9vy","year":"1978"},{"key":"10.1016\/0304-3975(84)90021-5_BIB7","article-title":"Graph representation and computation rules for typeless recursive program schemes","volume":"14","author":"Montangero","year":"1974"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584900215?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584900215?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:51:15Z","timestamp":1555127475000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397584900215"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1984]]}},"alternative-id":["0304397584900215"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(84)90021-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}