{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:28:57Z","timestamp":1761596937090},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055789X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023759","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:11:10Z","timestamp":1132395070000},"page":"79-95","source":"Crossref","is-referenced-by-count":5,"title":["A new approach to abstract data types II computation on ADTs as ordinary computation"],"prefix":"10.1007","author":[{"given":"Solomon","family":"Feferman","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"S. Feferman. A new approach to abstract data types, I. Informal development. Mathematical Structures in Computer Science (to appear).","DOI":"10.1017\/S0960129500001432"},{"key":"6_CR2","first-page":"373","volume-title":"Logic Colloquium '76","author":"S. Feferman","year":"1977","unstructured":"S. Feferman. Inductive schemata and recursively continuous functionals. Logic Colloquium '76, North-Holland, Amsterdam (1977), 373\u2013392."},{"key":"6_CR3","first-page":"1","volume":"91","author":"S.C. Kleene","year":"1959","unstructured":"S.C. Kleene. Recursive functionals and quantifiers of finite types I. Trans. Amer. Math. Soc.\n91 (1959), 1\u201352.","journal-title":"Trans. Amer. Math. Soc."},{"key":"6_CR4","first-page":"185","volume-title":"Generalized Recursion Theory II","author":"S.C. Kleene","year":"1978","unstructured":"S.C. Kleene. Recursive functionals and quantifiers of finite types revisited I. Generalized Recursion Theory II, North-Holland, Amsterdam (1978), 185\u2013222."},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BFb0099491","volume":"1104","author":"Y.N. Moschovakis","year":"1984","unstructured":"Y.N. Moschovakis. Abstract recursion as a foundation of the theory of recursive algorithms. Computation and Proof Theory, Lecture Notes in Mathematics 1104 (1984), 289\u2013364.","journal-title":"Lecture Notes in Mathematics"},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"1216","DOI":"10.1017\/S0022481200041086","volume":"54","author":"Y.N. Moschovakis","year":"1989","unstructured":"Y.N. Moschovakis. The formal language of recursion, J. Symbolic Logic\n54 (1989), 1216\u20131252.","journal-title":"J. Symbolic Logic"},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1002\/malq.19550010407","volume":"1","author":"J. Myhill","year":"1955","unstructured":"J. Myhill and J. Shepherdson. Effective operations on partial recursive functions. Zeitschr. Math. Logik u. Grundlag. Math. 1 (1955), 310\u2013317.","journal-title":"Zeitschr. Math. Logik u. Grundlag. Math."},{"key":"6_CR8","unstructured":"R.A. Platek. Foundations of Recursion Theory. Ph.D. Thesis, Stanford University, 1966."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023759.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:50:28Z","timestamp":1607550628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023759"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055789X"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0023759","relation":{},"subject":[]}}