{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T21:37:07Z","timestamp":1648762627356},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1974,2,1]],"date-time":"1974-02-01T00:00:00Z","timestamp":128908800000},"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":14411,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1974,2]]},"DOI":"10.1016\/s0022-0000(74)80020-6","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"22-35","source":"Crossref","is-referenced-by-count":0,"title":["On transformations of programs"],"prefix":"10.1016","volume":"8","author":[{"given":"Richard","family":"Bird","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(74)80020-6_bib1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0022-0000(67)80014-X","article-title":"Some definitional suggestions for automata theory","volume":"1","author":"Scott","year":"1967","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(74)80020-6_bib2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","article-title":"On the computational complexity of algorithms","volume":"117","author":"Hartmanis","year":"1965","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(74)80020-6_bib3","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1145\/362588.362598","article-title":"Another recursion induction principle","volume":"14","author":"Morris","year":"1971","journal-title":"Comm. ACM."},{"key":"10.1016\/S0022-0000(74)80020-6_bib4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/321160.321170","article-title":"Computability of recursive functions","volume":"10","author":"Shepherdson","year":"1963","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(74)80020-6_bib5","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/S0022-0000(69)80016-4","article-title":"Towards a theory of semantics and compilers for programming languages","volume":"3","author":"Blum","year":"1969","journal-title":"J. Comput. System Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800206?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800206?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T23:52:24Z","timestamp":1544140344000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000074800206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,2]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1974,2]]}},"alternative-id":["S0022000074800206"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(74)80020-6","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1974,2]]}}}