{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:19:46Z","timestamp":1742912386282,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382352"},{"type":"electronic","value":"9783642382369"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38236-9_13","type":"book-chapter","created":{"date-parts":[[2013,4,15]],"date-time":"2013-04-15T02:38:02Z","timestamp":1365993482000},"page":"133-143","source":"Crossref","is-referenced-by-count":1,"title":["A Notion of a Computational Step for Partial Combinatory Algebras"],"prefix":"10.1007","author":[{"given":"Nathanael L.","family":"Ackerman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cameron E.","family":"Freer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0304-3975(03)00360-8","volume":"311","author":"Y. Akama","year":"2004","unstructured":"Akama, Y.: Limiting partial combinatory algebras. Theoret. Comput. Sci.\u00a0311(1-3), 199\u2013220 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.2178\/bsl\/1243948484","volume":"15","author":"A. Blass","year":"2009","unstructured":"Blass, A., Dershowitz, N., Gurevich, Y.: When are two algorithms the same? Bull. Symbolic Logic\u00a015(2), 145\u2013168 (2009)","journal-title":"Bull. Symbolic Logic"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/2370728","volume":"51","author":"H.B. Curry","year":"1929","unstructured":"Curry, H.B.: An analysis of logical substitution. Amer. J. Math.\u00a051(3), 363\u2013384 (1929)","journal-title":"Amer. J. Math."},{"key":"13_CR4","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-11824-5","volume-title":"General recursion theory: an axiomatic approach","author":"J.E. Fenstad","year":"1980","unstructured":"Fenstad, J.E.: General recursion theory: an axiomatic approach. Perspectives in Mathematical Logic. Springer, Berlin (1980)"},{"key":"13_CR5","first-page":"361","volume-title":"Logic Colloquium 1969 (Proc. Summer School and Colloq., Manchester, 1969)","author":"H. Friedman","year":"1971","unstructured":"Friedman, H.: Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory. In: Logic Colloquium 1969 (Proc. Summer School and Colloq., Manchester, 1969), pp. 361\u2013389. North-Holland, Amsterdam (1971)"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/343369.343384","volume":"1","author":"Y. Gurevich","year":"2000","unstructured":"Gurevich, Y.: Sequential abstract-state machines capture sequential algorithms. ACM Trans. Comput. Log.\u00a01(1), 77\u2013111 (2000)","journal-title":"ACM Trans. Comput. Log."},{"key":"13_CR7","unstructured":"Longley, J.: Realizability toposes and language semantics. PhD thesis, University of Edinburgh, College of Science and Engineering, School of Informatics (1995)"},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1007\/978-3-642-56478-9_46","volume-title":"Mathematics Unlimited\u20142001 and Beyond","author":"Y.N. Moschovakis","year":"2001","unstructured":"Moschovakis, Y.N.: What is an algorithm? In: Mathematics Unlimited\u20142001 and Beyond, pp. 919\u2013936. Springer, Berlin (2001)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/11750321_5","volume-title":"Theory and Applications of Models of Computation","author":"M. Rathjen","year":"2006","unstructured":"Rathjen, M.: Models of intuitionistic set theories over partial combinatory algebras. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol.\u00a03959, pp. 68\u201378. Springer, Heidelberg (2006)"},{"issue":"3-4","key":"13_CR10","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01448013","volume":"92","author":"M. Sch\u00f6nfinkel","year":"1924","unstructured":"Sch\u00f6nfinkel, M.: \u00dcber die Bausteine der mathematischen Logik. Math. Ann.\u00a092(3-4), 305\u2013316 (1924)","journal-title":"Math. Ann."},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1305\/ndjfl\/1163775438","volume":"47","author":"J. van Oosten","year":"2006","unstructured":"van Oosten, J.: A general form of relative recursion. Notre Dame J. Formal Logic\u00a047(3), 311\u2013318 (2006)","journal-title":"Notre Dame J. Formal Logic"},{"key":"13_CR12","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Realizability: an introduction to its categorical side","author":"J. van Oosten","year":"2008","unstructured":"van Oosten, J.: Realizability: an introduction to its categorical side. Studies in Logic and the Foundations of Mathematics, vol.\u00a0152. Elsevier B. V., Amsterdam (2008)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38236-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T11:46:02Z","timestamp":1676807162000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-38236-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382352","9783642382369"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38236-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}