{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:39:03Z","timestamp":1725514743354},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540694052"},{"type":"electronic","value":"9783540694076"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69407-6_37","type":"book-chapter","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T09:39:35Z","timestamp":1213090775000},"page":"336-348","source":"Crossref","is-referenced-by-count":1,"title":["Recursion in Higher Types and Resource Bounded Turing Machines"],"prefix":"10.1007","author":[{"given":"Lars","family":"Kristiansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Avigad, J., Feferman, S.: G\u00f6del\u2019s functional interpretation. In: Buss, S. (ed.) Handbook of Proof Theory. Elsevier (1998)","DOI":"10.1016\/S0049-237X(98)80020-7"},{"key":"37_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Computation and Logic in the Real World","author":"G. Barra","year":"2007","unstructured":"Barra, G., Kristiansen, L., Voda, P.: Nondeterminism without Turing machines. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol.\u00a04497. Springer, Heidelberg (2007), \n                  \n                    http:\/\/www.mat.unisi.it\/~sorbi\/Proceedings.pdf"},{"key":"37_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/3-540-53414-8_37","volume-title":"Aspects and prospects of theoretical computer science","author":"A. Goerdt","year":"1990","unstructured":"Goerdt, A., Seidl, H.: Characterizing complexity classes by higher type primitive recursive definitions, part ii. In: Dassow, J., Kelemen, J. (eds.) Aspects and prospects of theoretical computer science, Smolenice. LNCS, vol.\u00a0464, pp. 148\u2013158. Springer, Heidelberg (1990)"},{"key":"37_CR4","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. Theoretical Computer Science\u00a0100, 45\u201366 (1992)","journal-title":"Theoretical Computer Science"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1017\/S0956796800003889","volume":"11","author":"N. Jones","year":"2001","unstructured":"Jones, N.: The expressive power of higher-order types or, life without CONS. Journal of Functional Programming\u00a011, 55\u201394 (2001)","journal-title":"Journal of Functional Programming"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(98)00357-0","volume":"228","author":"N. Jones","year":"1999","unstructured":"Jones, N.: LOGSPACE and PTIME characterized by programming languages. Theoretical Computer Science\u00a0228, 151\u2013174 (1999)","journal-title":"Theoretical Computer Science"},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/s00037-005-0191-0","volume":"14","author":"L. Kristiansen","year":"2005","unstructured":"Kristiansen, L.: Neat function algebraic characterizations of LOGSPACE and LINSPACE. Computational Complexity\u00a014, 72\u201388 (2005)","journal-title":"Computational Complexity"},{"key":"37_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/11780342_30","volume-title":"Logical Approaches to Computational Barriers","author":"L. Kristiansen","year":"2006","unstructured":"Kristiansen, L.: Complexity-theoretic hierarchies. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol.\u00a03988, pp. 279\u2013288. Springer, Heidelberg (2006)"},{"key":"37_CR9","volume-title":"Theory of Computing Systems","author":"L. Kristiansen","year":"2007","unstructured":"Kristiansen, L.: Complexity-theoretic hierarchies induced by fragments of G\u00f6del\u2019s \n                  \n                    \n                  \n                . In: Theory of Computing Systems. Springer, Heidelberg (2007)"},{"key":"37_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/11494645_32","volume-title":"New Computational Paradigms","author":"L. Kristiansen","year":"2005","unstructured":"Kristiansen, L., Barra, G.: The small Grzegorczyk classes and the typed \u03bb-calculus. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol.\u00a03526, pp. 252\u2013262. Springer, Heidelberg (2005)"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.ipl.2003.08.010","volume":"88","author":"L. Kristiansen","year":"2003","unstructured":"Kristiansen, L., Voda, P.: Complexity classes and fragments of C. Information Processing Letters\u00a088, 213\u2013218 (2003)","journal-title":"Information Processing Letters"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/978-3-540-45220-1_28","volume-title":"Computer Science Logic","author":"L. Kristiansen","year":"2003","unstructured":"Kristiansen, L., Voda, P.: The surprising power of restricted programs and G\u00f6del\u2019s functionals. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 345\u2013358. Springer, Heidelberg (2003)"},{"key":"37_CR13","first-page":"1","volume":"12","author":"L. Kristiansen","year":"2005","unstructured":"Kristiansen, L., Voda, P.: Programming languages capturing complexity classes. Nordic Journal of Computing\u00a012, 1\u201327 (2005); Special issue for NWPT 2004","journal-title":"Nordic Journal of Computing"},{"key":"37_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/11750321_62","volume-title":"Theory and Applications of Models of Computation","author":"L. Kristiansen","year":"2006","unstructured":"Kristiansen, L., Voda, P.: The trade-off theorem and fragments of G\u00f6del\u2019s \n                  \n                    \n                  \n                . In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol.\u00a03959, pp. 654\u2013674. Springer, Heidelberg (2006)"},{"key":"37_CR15","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Classical recursion theory II","author":"P. Odifreddi","year":"1999","unstructured":"Odifreddi, P.: Classical recursion theory II. Studies in Logic and the Foundations of Mathematics, vol.\u00a0143. North-Holland Publishing Co., Amsterdam (1999)"},{"key":"37_CR16","doi-asserted-by":"crossref","DOI":"10.1142\/6284","volume-title":"Domain-theoretic foundations of functional programming","author":"T. Streicher","year":"2006","unstructured":"Streicher, T.: Domain-theoretic foundations of functional programming. World Scientific Publishing Co. Pte. Ltd, Singapore (2006)"}],"container-title":["Lecture Notes in Computer Science","Logic and Theory of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69407-6_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:38:33Z","timestamp":1620002313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69407-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540694052","9783540694076"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69407-6_37","relation":{},"subject":[]}}