{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:05:46Z","timestamp":1725566746144},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282310"},{"type":"electronic","value":"9783540318972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538363_36","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:35:33Z","timestamp":1127828133000},"page":"525-540","source":"Crossref","is-referenced-by-count":1,"title":["Identifying Polynomial-Time Recursive Functions"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Sch\u00fcrmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jatin","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the polytime functions. In: Twenty-fourth Annual ACM Symposium on Theory of Computing (1992)","DOI":"10.1145\/129712.129740"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/LICS.1991.151625","volume-title":"Sixth Annual IEEE Symposium on Logic in Computer Science","author":"D. Leivant","year":"1991","unstructured":"Leivant, D.: A foundational delineation of computational feasibility. In: Sixth Annual IEEE Symposium on Logic in Computer Science, pp. 2\u201311. IEEE, Los Alamitos (1991)"},{"key":"36_CR3","unstructured":"Cobham, A.: The intrinsic computational complexity of functions. In: Bar-Hellel, Y. (ed.) Proceedings of the 1964 International Congress for Logic, Methodology, and the Philosophy of Science, pp. 24\u201330 (1965)"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Leivant, D.: Subrecursion and lambda representation over free algebras. In: Buss, S., Scott, P. (eds.) Feasible Mathematics, Birkhauser, pp. 281\u2013292 (1990)","DOI":"10.1007\/978-1-4612-3466-1_16"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Bellantoni, S., Niggl, K.H., Schwichtenberg, H.: Higher type recursion, ramification and polynomial time. Annals of Pure and Applied Logic\u00a0104 (2000)","DOI":"10.1016\/S0168-0072(00)00006-3"},{"key":"36_CR6","unstructured":"Hofmann, M.: Typed lambda calculi for polynomial-time computation. Habilitation thesis, TU Darmstadt (1998)"},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0168-0072(00)00010-5","volume":"104","author":"M. Hofmann","year":"2000","unstructured":"Hofmann, M.: Safe recursion with higher types and BCK-algebra. Annals of Pure Applied Logic\u00a0104, 113\u2013166 (2000)","journal-title":"Annals of Pure Applied Logic"},{"key":"36_CR8","series-title":"Lecture Notes in Artificial Intelligence","first-page":"5114","volume-title":"Automated Reasoning","author":"H. Ganzinger","year":"2001","unstructured":"Ganzinger, H., McAllester, D.: A new meta-complexity theorem for bottom-up logic programs. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 5114\u20135128. Springer, Heidelberg (2001)"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1145\/566385.566387","volume":"3","author":"R. Givan","year":"2002","unstructured":"Givan, R., McAllester, D.: Polynomial-time computation via local inference relations. ACM Transactions on Computational Logic\u00a03, 521\u2013541 (2002)","journal-title":"ACM Transactions on Computational Logic"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Aehlig, K., Schwichtenberg, H.: A syntactical analysis of non-size-increasing polynomial time computation. In: Fifteenth Annual IEEE Symposium on Logic in Computer Science (2000)","DOI":"10.1109\/LICS.2000.855758"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0890-5401(03)00009-9","volume":"183","author":"M. Hofmann","year":"2003","unstructured":"Hofmann, M.: Linear types and non-size-increasing polynomial time computation. Information and Computation\u00a0183, 57\u201385 (2003)","journal-title":"Information and Computation"},{"key":"36_CR12","first-page":"296","volume-title":"Proceedings of the European Symposium on Programming","author":"E. Rohwedder","year":"1996","unstructured":"Rohwedder, E., Pfenning, F.: Mode and termination checking for higher-order logic programs. In: Nielson, H.R. (ed.) Proceedings of the European Symposium on Programming, Link\u00f6ping, Sweden, pp. 296\u2013310. Springer, Heidelberg (1996)"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1093\/logcom\/1.4.497","volume":"1","author":"D. Miller","year":"1991","unstructured":"Miller, D.: A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation\u00a01, 497\u2013536 (1991)","journal-title":"Journal of Logic and Computation"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1093\/logcom\/6.3.315","volume":"6","author":"Z. Qian","year":"1996","unstructured":"Qian, Z.: Unification of higher-order patterns in linear time and space. J. Log. Comput.\u00a06, 315\u2013341 (1996)","journal-title":"J. Log. Comput."},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1137\/S0097539792240583","volume":"26","author":"R.M. Verma","year":"1997","unstructured":"Verma, R.M.: General techniques for analyzing recursive algorithms with applications. SIAM Journal of Computing\u00a026, 568\u2013581 (1997)","journal-title":"SIAM Journal of Computing"},{"key":"36_CR16","unstructured":"Caseiro, V.H.: Equations for defining poly-time functions. PhD thesis, University of Oslo (1997)"},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"27","DOI":"10.2307\/2964334","volume":"25","author":"R. Harrop","year":"1960","unstructured":"Harrop, R.: Concerning formulas of the types A \u2192 B\u2228C,A \u2192 (Ex)(Bx). Journal of Symbolic Logic\u00a025, 27\u201332 (1960)","journal-title":"Journal of Symbolic Logic"},{"key":"36_CR18","unstructured":"Miller, D.: Hereditary harrop formulas and logic programming. In: Proceedings of the VIII International Congress of Logic, Methodology, and Philosophy of Science, Moscow (1987)"},{"key":"36_CR19","volume-title":"Eighth ACM SIGPLAN International Conference on Functional Programming, Workshop on Mechanized reasoning about languages with variable binding","author":"C. Sch\u00fcrmann","year":"2003","unstructured":"Sch\u00fcrmann, C., Shah, J.: Representing reductions of NP-complete problems in logical frameworks: A case study. In: Eighth ACM SIGPLAN International Conference on Functional Programming, Workshop on Mechanized reasoning about languages with variable binding, MERLIN, ACM, New York (2003)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538363_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:54:18Z","timestamp":1619506458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538363_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282310","9783540318972"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11538363_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}