{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T02:09:07Z","timestamp":1648951747741},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1974,6,1]],"date-time":"1974-06-01T00:00:00Z","timestamp":139276800000},"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":14291,"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,6]]},"DOI":"10.1016\/s0022-0000(74)80030-9","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"387-408","source":"Crossref","is-referenced-by-count":14,"title":["Translatability of schemas over restricted interpretations"],"prefix":"10.1016","volume":"8","author":[{"given":"A.J.","family":"Kfoury","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(74)80030-9_bib1","series-title":"Proc. of 12th SWAT Symposium","article-title":"Effective computation over the real numbers","author":"Abramson","year":"1971"},{"key":"10.1016\/S0022-0000(74)80030-9_bib2","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1137\/0201017","article-title":"Program schemes with pushdown stores","volume":"1","author":"Brown","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(74)80030-9_bib3","series-title":"Proc. of 4th ACM Symposium on Theory of Computing","article-title":"Program schemas with equality","author":"Chandra","year":"1972"},{"key":"10.1016\/S0022-0000(74)80030-9_bib4","series-title":"Logic '69","article-title":"Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory","author":"Friedman","year":"1970"},{"key":"10.1016\/S0022-0000(74)80030-9_bib5","doi-asserted-by":"crossref","DOI":"10.1016\/S0022-0000(73)80040-6","article-title":"Program schemes, recursion schemes, and formal languages","volume":"7","author":"Garland","year":"1973","journal-title":"J. Comput. Sys. Sci."},{"key":"10.1016\/S0022-0000(74)80030-9_bib6","series-title":"Proc. of 4th ACM Symposium on Theory of Computing","article-title":"On the equivalence of schemes","author":"Garland","year":"1972"},{"key":"10.1016\/S0022-0000(74)80030-9_bib7","series-title":"Proc. of IRIA Symposium on Automata, Languages, and Programming","article-title":"Comparing algebraic structures up to algorithmic equivalence","author":"Kfoury","year":"1973"},{"key":"10.1016\/S0022-0000(74)80030-9_bib8","series-title":"Theory of Models","article-title":"Model-theoretic invariants","author":"Kreisel","year":"1965"},{"key":"10.1016\/S0022-0000(74)80030-9_bib9","first-page":"427","article-title":"Abstract computability","volume":"138","author":"Moschovakis","year":"1969","journal-title":"Trans. Am. Math. Society"},{"key":"10.1016\/S0022-0000(74)80030-9_bib10","series-title":"Machine Intelligence 3","article-title":"Program schemata","author":"Paterson","year":"1968"},{"key":"10.1016\/S0022-0000(74)80030-9_bib11","article-title":"Equivalence problems in a model of computation","author":"Paterson","year":"1970"},{"key":"10.1016\/S0022-0000(74)80030-9_bib12","series-title":"Project MAC Conf. on Concurrent Systems and Parallel Computation","article-title":"Comparative schematology","author":"Paterson","year":"1970"},{"key":"10.1016\/S0022-0000(74)80030-9_bib13","series-title":"Symposium on Semantics of Algorithmic Languages","article-title":"The lattice of flow-diagrams","author":"Scott","year":"1971"},{"key":"10.1016\/S0022-0000(74)80030-9_bib14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/321160.321170","article-title":"The computability of partial recursive functions","volume":"10","author":"Shepherdson","year":"1963","journal-title":"J. Assoc. Comp. Mach."},{"key":"10.1016\/S0022-0000(74)80030-9_bib15","series-title":"Proc. of 12th SWAT Symposium","article-title":"High level languages of maximum power","author":"Strong","year":"1971"},{"key":"10.1016\/S0022-0000(74)80030-9_bib16","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/S0022-0000(71)80036-3","article-title":"Translating recursion equations into flow-charts","volume":"5","author":"Strong","year":"1971","journal-title":"J. Comput. Sys. Sci."},{"key":"10.1016\/S0022-0000(74)80030-9_bib17","volume":"Vol. 25","author":"Birkhoff","year":"1967"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800309?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800309?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:18Z","timestamp":1544140338000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000074800309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,6]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1974,6]]}},"alternative-id":["S0022000074800309"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(74)80030-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1974,6]]}}}