{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T23:04:04Z","timestamp":1746745444722},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1980,5,1]],"date-time":"1980-05-01T00:00:00Z","timestamp":325987200000},"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":12130,"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":[[1980,5]]},"DOI":"10.1016\/0304-3975(80)90033-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"39-47","source":"Crossref","is-referenced-by-count":9,"title":["Speeding up subtree replacement systems"],"prefix":"10.1016","volume":"11","author":[{"given":"John","family":"Staples","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(80)90033-X_BIB1","article-title":"Commutativity of independent transformations on complex objects","author":"Ehrig","year":"1976","journal-title":"I.B.M. Research Report RC 6251"},{"key":"10.1016\/0304-3975(80)90033-X_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2272337","article-title":"An abstract Church-Rosser theorem, II: applications","volume":"39","author":"Hindley","year":"1974","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(80)90033-X_BIB3","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","article-title":"Tree-manipulating systems and Church-Rosser theorems","volume":"20","author":"Rosen","year":"1973","journal-title":"JACM"},{"key":"10.1016\/0304-3975(80)90033-X_BIB4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1017\/S0004972700010625","article-title":"A class of replacement systems with simple optimality theory","volume":"17","author":"Staples","year":"1977","journal-title":"Bull. Austral. Math. Soc."},{"key":"10.1016\/0304-3975(80)90033-X_BIB5","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(80)90033-X_BIB6","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."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758090033X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758090033X?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:24:34Z","timestamp":1555125874000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758090033X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,5]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,5]]}},"alternative-id":["030439758090033X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(80)90033-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1980,5]]}}}