{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T19:29:06Z","timestamp":1672342146027},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":9694,"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":[[1987]]},"DOI":"10.1016\/0304-3975(87)90079-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"37-58","source":"Crossref","is-referenced-by-count":39,"title":["On \u201con graph rewritings\u201d"],"prefix":"10.1016","volume":"52","author":[{"given":"Richard","family":"Kennaway","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(87)90079-X_BIB1","series-title":"Proc. PARLE","first-page":"141","article-title":"Term graph reduction","volume":"259","author":"Barendregt","year":"1987"},{"key":"10.1016\/0304-3975(87)90079-X_BIB2","series-title":"Rept. CSR-62-80","article-title":"HOPE: an experimental applicative language","author":"Burstall","year":"1980"},{"key":"10.1016\/0304-3975(87)90079-X_BIB3","series-title":"Logic Programming","author":"Clark","year":"1982"},{"key":"10.1016\/0304-3975(87)90079-X_BIB4","unstructured":"J.R.W. Glauert, J.R. Kennaway and M.R. Sleep, Categorical descriptions of graph rewriting and garbage collection, in preparation."},{"key":"10.1016\/0304-3975(87)90079-X_BIB5","first-page":"509","article-title":"Dactl: A computational model and compiler target language based on graph reduction","volume":"5","author":"Glauert","year":"1987","journal-title":"ICL Technical Journal"},{"key":"10.1016\/0304-3975(87)90079-X_BIB6","series-title":"Rept. CSA\/19\/1984","article-title":"An outline of some results of Staples on optimal reduction orders in replacement systems","author":"Kennaway","year":"1984"},{"key":"10.1016\/0304-3975(87)90079-X_BIB7","series-title":"Category Theory for the Working Mathematician","author":"MacLane","year":"1971"},{"key":"10.1016\/0304-3975(87)90079-X_BIB8","series-title":"Rept. CSR-157-83","article-title":"A proposal for Standard ML","author":"Milner","year":"1983"},{"key":"10.1016\/0304-3975(87)90079-X_BIB9","series-title":"The Implementation of Functional Languages","author":"Peyton-Jones","year":"1987"},{"key":"10.1016\/0304-3975(87)90079-X_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(84)90021-5","article-title":"On graph rewritings","volume":"32","author":"Raoult","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(87)90079-X_BIB11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(80)90013-4","article-title":"Computation on graph-like expressions","volume":"10","author":"Staples","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(87)90079-X_BIB12","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(80)90051-1","article-title":"Optimal evaluations of graph-like expressions","volume":"10","author":"Staples","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(87)90079-X_BIB13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0304-3975(80)90033-X","article-title":"Speeding up subtree replacement systems","volume":"11","author":"Staples","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(87)90079-X_BIB14","series-title":"SASL Language Manual","author":"Turner","year":"1976"},{"key":"10.1016\/0304-3975(87)90079-X_BIB15","series-title":"Miranda Language Manual","author":"Turner","year":"1986"},{"key":"10.1016\/0304-3975(87)90079-X_BIB16","series-title":"Ph.D. Thesis","article-title":"Semantics and pragmatics of the lambda-calculus","author":"Wadsworth","year":"1971"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758790079X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758790079X?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:52:28Z","timestamp":1555127548000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758790079X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1987]]}},"alternative-id":["030439758790079X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(87)90079-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}