{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:47:46Z","timestamp":1725558466366},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408017"},{"type":"electronic","value":"9783540452201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45220-1_28","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T19:33:58Z","timestamp":1277494438000},"page":"345-358","source":"Crossref","is-referenced-by-count":9,"title":["The Surprising Power of Restricted Programs and G\u00f6del\u2019s Functionals"],"prefix":"10.1007","author":[{"given":"Lars","family":"Kristiansen","sequence":"first","affiliation":[]},{"given":"Paul J.","family":"Voda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","volume-title":"Handbook of Proof Theory","author":"J. Avigad","year":"1998","unstructured":"Avigad, J., Fererman, S.: G\u00f6del\u2019s functional interpretation. In: Buss (ed.) Handbook of Proof Theory, Elsevier, Amsterdam (1998)"},{"issue":"7","key":"28_CR2","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s001530050160","volume":"39","author":"A. Beckmann","year":"2000","unstructured":"Beckmann, A., Weiermann, A.: Characterizing the elementary recursive functions by a fragment of G\u00f6del\u2019s T. Arch. Math. Logic\u00a039(7), 475\u2013491 (2000)","journal-title":"Arch. Math. Logic"},{"issue":"1","key":"28_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(92)90363-K","volume":"100","author":"A. Goerdt","year":"1992","unstructured":"Goerdt, A.: Characterizing complexity classes by higher type primitive recursive definitions. Theor. Comput. Sci.\u00a0100(1), 45\u201366 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1017\/S0956796800003889","volume":"11","author":"N.D. Jones","year":"2001","unstructured":"Jones, N.D.: The expressive power of higher-order types or, life without CONS. J. Functional Programming\u00a011, 55\u201394 (2001)","journal-title":"J. Functional Programming"},{"key":"28_CR5","unstructured":"Kristiansen, L., Voda, P.J.: Complexity classes and fragments of C (submitted), Preprint available from \n                  \n                    http:\/\/www.iu.hio.no\/~larskri\/"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/3-540-60178-3_84","volume-title":"Logic and Computational Complexity","author":"D. Leivant","year":"1995","unstructured":"Leivant, D.: Intrinsic theories and cpmputational complexity. In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 177\u2013194. Springer, Heidelberg (1995)"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1090\/S0002-9947-1963-0158822-2","volume":"106","author":"R.W. Ritchie","year":"1963","unstructured":"Ritchie, R.W.: Classes of predictably computable functions. Trans. Am. Math. Soc.\u00a0106, 139\u2013173 (1963)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1-3","key":"28_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0168-0072(97)00073-0","volume":"94","author":"H. Schwichtenberg","year":"1998","unstructured":"Schwichtenberg, H.: Finite notations for infinite terms. Ann. Pure Appl. Logic\u00a094(1-3), 201\u2013222 (1998)","journal-title":"Ann. Pure Appl. Logic"},{"key":"28_CR9","unstructured":"Schwichtenberg, H., Bellantoni, S.J.: Feasible computation with higher types. Available from Schwichtenberg\u2019s home page"},{"key":"28_CR10","first-page":"344","volume-title":"Mathematical logic","author":"J.R. Shoenfield","year":"1967","unstructured":"Shoenfield, J.R.: Mathematical logic, vol.\u00a0VII, p. 344. Addison-Wesley Publishing Company, Reading (1967)"},{"key":"28_CR11","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Derivation and computation. Taking the Curry-Howard correspondenceseriously","author":"H. Simmons","year":"2000","unstructured":"Simmons, H.: Derivation and computation. Taking the Curry-Howard correspondenceseriously. Cambridge Tracts in Theoretical Computer Science, vol.\u00a051. Cambridge University, Cambridge (2000)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BFb0016242","volume-title":"Mathematical Foundations of Computer Science 1986","author":"J. Tiuryn","year":"1986","unstructured":"Tiuryn, J.: Higher-order arrays and stacks in programming. An application of complexity theory to logics of programs. In: Wiedermann, J., Gruska, J., Rovan, B. (eds.) MFCS 1986. LNCS, vol.\u00a0233, pp. 177\u2013198. Springer, Heidelberg (1986)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45220-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T17:56:19Z","timestamp":1547747779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45220-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408017","9783540452201"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45220-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}