{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T04:40:02Z","timestamp":1737607202003,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665366"},{"type":"electronic","value":"9783540481683"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48168-0_7","type":"book-chapter","created":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T11:30:26Z","timestamp":1196508626000},"page":"82-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Applicative Control and Computational Complexity"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Leivant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"7_CR1","unstructured":"Arnold Beckmann and Andreas Weiermann. Characterizing the elementary recursive functions by a fragment of G\u00f6del\u2019s T. Manuscript, www.math.unimuenster http:\/\/www.math.unimuenster.de\/math\/inst\/logik\/publ\/pap\/20.html."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"S. Bellantoni. Predicative recursion and the polytime hierarchy. In Peter Clote and Jeffery Remmel, editors, Feasible Mathematics II, Perspectives in Computer Science, pages 15\u201329. Birkh\u00e4user, 1994.","DOI":"10.1007\/978-1-4612-2566-9_2"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S. Bellantoni","year":"1992","unstructured":"S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the poly-time functions. Computational Complexity, 2:97\u2013110, 1992.","journal-title":"Computational Complexity"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"S. Bloch. Functional characterizations of uniform log-depth and polylogdepth circuit families. In Proceedings of the Seventh Annual Structure in Complexity Theory Conference, pages 193\u2013206. IEEE Computer Society Press, 1992.","DOI":"10.1109\/SCT.1992.215394"},{"key":"7_CR5","first-page":"24","volume-title":"Proceedings of the International Conference on Logic, Methodology, and Philosophy of Science","author":"A. Cobham","year":"1962","unstructured":"A. Cobham. The intrinsic computational difficulty of functions. In Y. Bar-Hillel, editor, Proceedings of the International Conference on Logic, Methodology, and Philosophy of Science, pages 24\u201330. North-Holland, Amsterdam, 1962."},{"key":"7_CR6","unstructured":"W.G. Handley. Bellantoni and Cook\u2019s characterization of polynomial time functions. Typescript, August 1992."},{"key":"7_CR7","unstructured":"Martin Hofmann. Type systems for polynomial-time computation. Habilitationsschrift, 1998."},{"key":"7_CR8","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2003.001.0001","volume-title":"Computability and Complexity from a Programming Perspective","author":"N. Jones","year":"1997","unstructured":"N. Jones. Computability and Complexity from a Programming Perspective. MIT Press, Cambridge, MA, 1997."},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-1-4612-3466-1_16","volume-title":"Feasible Mathematics","author":"D. Leivant","year":"1990","unstructured":"D. Leivant. Subrecursion and lambda representation over free algebras. In Samuel Buss and Philip Scott, editors, Feasible Mathematics, Perspectives in Computer Science, pages 281\u2013291. Birkhauser-Boston, New York, 1990."},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"D. Leivant. Stratified functional programs and computational complexity. In Conference Record of the Twentieth Annual ACM Symposium on Principles of Programming Languages, pages 325\u2013333, New York, 1993. ACM.","DOI":"10.1145\/158511.158659"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"D. Leivant. A foundational delineation of poly-time. Information and Computation, 1994. (Special issue of selected papers from LICS\u201991, edited by G. Kahn).","DOI":"10.1006\/inco.1994.1038"},{"key":"7_CR12","first-page":"320","volume-title":"Feasible Mathematics II","author":"D. Leivant","year":"1994","unstructured":"D. Leivant. Ramified recurrence and computational complexity I: Word recurrence and poly-time. In Peter Clote and Jeffrey Remmel, editors, Feasible Mathematics II, pages 320\u2013343. Birkh\u00e4user-Boston, New York, 1994."},{"key":"7_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-60178-3_84","volume-title":"Logic and Coputational Complexity","author":"D. Leivant","year":"1995","unstructured":"D. Leivant. Intrinsic theories and computational complexity. In D. Leivant, editor, Logic and Coputational Complexity, volume 960 of LNCS, pages 177\u2013194. Springer-Verlag, Berlin, 1995."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"D. Leivant. A characterization of NC by tree recurrence. In Thirty Ninth Annual Symposium on Foundations of Computer Science (FOCS), pages 716\u2013724, Los Alamitos, CA, 1998. IEEE Computer Society.","DOI":"10.1109\/SFCS.1998.743522"},{"key":"7_CR15","unstructured":"D. Leivant. Ramified recurrence and computational complexity III: Higher type recurrence and elementary complexity. Annals of Pure and Applied Logic, 1998. Special issue in honor of Rohit Parikh\u2019s 60th Birthday; editors: M. Fitting, R. Ramanujam and K. Georgatos."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"D. Leivant and J.-Y. Marion. Lambda-calculus characterizations of polytime. Fundamenta Informaticae, 19:167\u2013184, 1993. Special Issue: Lambda Calculus and Type Theory (editor: J. Tiuryn).","DOI":"10.3233\/FI-1993-191-207"},{"key":"7_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1007\/BFb0022277","volume-title":"Proceedings of CSL 94","author":"D. Leivant","year":"1995","unstructured":"D. Leivant and J.-Y. Marion. Ramified recurrence and computational complexity II: substitution and poly-space. In L. Pacholski and J. Tiuryn, editors, Proceedings of CSL 94, pages 486\u2013500. LNCS 933, Springer Verlag, 1995."},{"key":"7_CR18","unstructured":"D. Leivant and J.-Y. Marion. Ramified recurrence and computational complexity IV: Predicative functionals and poly-space. Information and Computation, 1999."},{"key":"7_CR19","unstructured":"D. Leivant and J.-Y. Marion. Ramified recurrence and computational complexity V: linear tree recurrence and alternating log-time. Theoretical Computer Science, 1999. Special issue for CAAP\u201998, editor: M. Duachet."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"J. Mitchell, M. Mithcell, and A. Scedrov. A linguistic characterization of bounded oracle computation and probabilistic polynomial time. In Thirty Ninth Annual Symposium on Foundations of Computer Science (FOCS), pages 725\u2013733, Los Alamitos, CA, 1998. IEEE Computer Society.","DOI":"10.1109\/SFCS.1998.743523"},{"key":"7_CR21","unstructured":"K.-H. Niggl S. Bellantoni and H. Schwichtenberg. Higher type ramification and polynomial time. manuscript, to appear, 1999."},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Kurt Sch\u00fctte. Proof Theory. Springer-Verlag, 1977.","DOI":"10.1007\/978-3-642-66473-1"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01620765","volume":"27","author":"H. Simmons","year":"1988","unstructured":"H. Simmons. The realm of primitive recursion. Archive for Mathematical Logic, 27:177\u2013188, 1988.","journal-title":"Archive for Mathematical Logic"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48168-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T03:46:25Z","timestamp":1737603985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48168-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665366","9783540481683"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-48168-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"13 May 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}