{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:25:56Z","timestamp":1725575156905},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261797"},{"type":"electronic","value":"9783540322665"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11494645_32","type":"book-chapter","created":{"date-parts":[[2011,1,16]],"date-time":"2011-01-16T17:37:10Z","timestamp":1295199430000},"page":"252-262","source":"Crossref","is-referenced-by-count":8,"title":["The Small Grzegorczyk Classes and the Typed \u03bb-Calculus"],"prefix":"10.1007","author":[{"given":"Lars","family":"Kristiansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathias","family":"Barra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7","key":"32_CR1","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"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF01201998","volume":"2","author":"S.J. Bellantoni","year":"1992","unstructured":"Bellantoni, S.J., Cook, S.: A New Recursion-Theoretic Characterization of the Polytime Functions. Computational Complexity\u00a02, 7\u2013110 (1992)","journal-title":"Computational Complexity"},{"key":"#cr-split#-32_CR3.1","unstructured":"Bel???tyukov, A.P.: A machine description and the hierarchy of initial Grzegorczyk classes. Zap. Naucn. Sem. Leninigrad. Otdel. May. Inst. Steklov. (LOMI)??88, 30???46 (1979);"},{"key":"#cr-split#-32_CR3.2","unstructured":"J. Soviet Math. 20 (1982)"},{"key":"32_CR4","volume-title":"Handbook of Computability Theory","author":"P. Clote","year":"1996","unstructured":"Clote, P.: Computation Models and Function Algebra. In: Griffor, E. (ed.) Handbook of Computability Theory. Elsevier, Amsterdam (1996)"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0304-3975(97)00002-9","volume":"193","author":"M.-A. Esbelin","year":"1998","unstructured":"Esbelin, M.-A., More, M.: Rudimentary relations and primitive recursion: A toolbox. Theoretical Computer Science\u00a0193, 129\u2013148 (1998)","journal-title":"Theoretical Computer Science"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Gandy, R.: Some relations between classes of low computational complexity. Bulletin of London Mathematical Society, 127\u2013134 (1984)","DOI":"10.1112\/blms\/16.2.127"},{"key":"32_CR7","unstructured":"Grzegorczyk, A.: Some classes of recursive functions. Rozprawy Matematyczne, No. IV, Warszawa (1953)"},{"key":"32_CR8","unstructured":"Harrow, K.: Sub-elementary classes of functions and relations. Doctoral Dissertation, New York University, Department of Mathematics (1973)"},{"key":"32_CR9","series-title":"London Mathematical Society, Student Texts","volume-title":"Introduction to Combinators and \u03bb-caclulus","author":"J.R. Hindley","year":"1984","unstructured":"Hindley, J.R., Seldin, J.P.: Introduction to Combinators and \u03bb-caclulus. London Mathematical Society, Student Texts, vol.\u00a01. Cambridge University Press, Cambridge (1984)"},{"key":"32_CR10","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":"32_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(98)00357-0","volume":"228","author":"N.D. Jones","year":"1999","unstructured":"Jones, N.D.: LOGSPACE and PTIME characterized by programming languages. Theoretical Computer Science\u00a0228, 151\u2013174 (1999)","journal-title":"Theoretical Computer Science"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Kristiansen, L.: Neat function algebraic characterizations of LOGSPACE and LINSPACE. Computational Complexity (accepted)","DOI":"10.1007\/s00037-005-0191-0"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.tcs.2003.10.016","volume":"318","author":"L. Kristiansen","year":"2004","unstructured":"Kristiansen, L., Niggl, K.-H.: On the computational complexity of imperative programming languages. Theoretical Computer Science\u00a0318, 139\u2013161 (2004)","journal-title":"Theoretical Computer Science"},{"key":"32_CR14","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.J.: Complexity classes and fragments of C. Information Processing Letters\u00a088, 213\u2013218 (2003)","journal-title":"Information Processing Letters"},{"key":"32_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.J.: 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":"32_CR16","unstructured":"Kristiansen, L., Voda, P.J.: Programming languages capturing complexity classes (Submitted)"},{"issue":"2","key":"32_CR17","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1112\/jlms\/s2-36.2.193","volume":"36","author":"M. Kutylowski","year":"1987","unstructured":"Kutylowski, M.: Small Grzegorczyk classes. J. London Math. Soc.\u00a036(2), 193\u2013210 (1987)","journal-title":"J. London Math. Soc."},{"key":"32_CR18","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 computational complexity. In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 177\u2013194. Springer, Heidelberg (1995)"},{"key":"32_CR19","volume-title":"Classical Recursion Theory","author":"P. Odifreddi","year":"1999","unstructured":"Odifreddi, P.: Classical Recursion Theory, vol.\u00a0II. North-Holland, Amsterdam (1999)"},{"key":"32_CR20","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BFb0075316","volume-title":"Methods in mathematical logic. Proceedings, Caracas 1983","author":"J.B. Paris","year":"1985","unstructured":"Paris, J.B., Wilkie, A.: Counting problems in bounded arithmetic. In: Methods in mathematical logic. Proceedings, Caracas 1983. Lecture Notes in Mathematics, vol.\u00a01130, pp. 317\u2013340. Springer, Heidelberg (1985)"},{"key":"32_CR21","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."},{"key":"32_CR22","volume-title":"Subrecursion. Functions and hierarchies","author":"H.E. Rose","year":"1984","unstructured":"Rose, H.E.: Subrecursion. Functions and hierarchies. Clarendon Press, Oxford (1984)"},{"key":"32_CR23","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01620765","volume":"27","author":"H. Simmons","year":"1988","unstructured":"Simmons, H.: The realm of primitive recursion. Arch. Math. Logic\u00a027, 177\u2013188 (1988)","journal-title":"Arch. Math. Logic"},{"key":"32_CR24","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Derivation and computation. Taking the Curry-Howard correspondence seriously","author":"H. Simmons","year":"2000","unstructured":"Simmons, H.: Derivation and computation. Taking the Curry-Howard correspondence seriously. Cambridge Tracts in Theoretical Computer Science, vol.\u00a051. Cambridge University, Cambridge (2000)"},{"key":"#cr-split#-32_CR25.1","unstructured":"Terese: Term Rewriting Systems. Cambridge University Press, Cambridge (2003);"},{"key":"#cr-split#-32_CR25.2","unstructured":"Bezem, M., Klop, J.W., de Vrijer, R. (eds.)"}],"container-title":["Lecture Notes in Computer Science","New Computational Paradigms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11494645_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:38:13Z","timestamp":1619505493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11494645_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261797","9783540322665"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11494645_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}