{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:56:25Z","timestamp":1725796585007},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319089171"},{"type":"electronic","value":"9783319089188"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08918-8_13","type":"book-chapter","created":{"date-parts":[[2014,7,2]],"date-time":"2014-07-02T05:44:22Z","timestamp":1404279862000},"page":"179-193","source":"Crossref","is-referenced-by-count":3,"title":["An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting"],"prefix":"10.1007","author":[{"given":"Daniel","family":"de Carvalho","sequence":"first","affiliation":[]},{"given":"Jakob Grue","family":"Simonsen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"13_CR1","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. Theor. Comput. Sci.\u00a0228(1-2), 151\u2013174 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/11784180_8","volume-title":"Algebraic Methodology and Software Technology","author":"G. Bonfante","year":"2006","unstructured":"Bonfante, G.: Some programming languages for logspace and ptime. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol.\u00a04019, pp. 66\u201380. Springer, Heidelberg (2006)"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"5","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. Funct. Program.\u00a011(1), 5\u201394 (2001)","journal-title":"J. Funct. Program."},{"key":"13_CR4","unstructured":"Avanzini, M., Moser, G.: Closing the gap between runtime complexity and polytime computability. In: Lynch, C. (ed.) RTA. LIPIcs, vol.\u00a06, pp. 33\u201348. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)"},{"key":"13_CR5","unstructured":"Hofmann, M.: Type systems for polynomial-time computation. Habilitationsschrift (1999)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S. Bellantoni","year":"1992","unstructured":"Bellantoni, S., Cook, S.A.: A new recursion-theoretic characterization of the polytime functions. Computational Complexity\u00a02, 97\u2013110 (1992)","journal-title":"Computational Complexity"},{"issue":"1-3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0168-0072(00)00006-3","volume":"104","author":"S.J. Bellantoni","year":"2000","unstructured":"Bellantoni, S.J., Niggl, K.H., Schwichtenberg, H.: Higher type recursion, ramification and polynomial time. Ann. Pure Appl. Logic\u00a0104(1-3), 17\u201330 (2000)","journal-title":"Ann. Pure Appl. Logic"},{"key":"13_CR8","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","first-page":"62","volume-title":"Computer Science Logic (CSL 2012)","author":"P. Baillot","year":"2012","unstructured":"Baillot, P., Lago, U.D.: Higher-Order Interpretations and Program Complexity. In: C\u00e9gielski, P., Durand, A. (eds.) Computer Science Logic (CSL 2012). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a016, pp. 62\u201376. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl (2012)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-73228-0_2","volume-title":"Typed Lambda Calculi and Applications","author":"P. Baillot","year":"2007","unstructured":"Baillot, P.: From proof-nets to linear logic type systems for polynomial time computing. In: Ronchi Della Rocca, S. (ed.) TLCA 2007. LNCS, vol.\u00a04583, pp. 2\u20137. Springer, Heidelberg (2007)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-11957-6_7","volume-title":"Programming Languages and Systems","author":"P. Baillot","year":"2010","unstructured":"Baillot, P., Gaboardi, M., Mogbil, V.: A polytime functional language from light linear logic. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol.\u00a06012, pp. 104\u2013124. Springer, Heidelberg (2010)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-35182-2_20","volume-title":"Programming Languages and Systems","author":"M. Avanzini","year":"2012","unstructured":"Avanzini, M., Eguchi, N., Moser, G.: A new order-theoretic characterisation of the polytime computable functions. In: Jhala, R., Igarashi, A. (eds.) APLAS 2012. LNCS, vol.\u00a07705, pp. 280\u2013295. Springer, Heidelberg (2012)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Avanzini, M., Moser, G.: Polynomial path orders. Logical Methods in Computer Science 9(4) (2013)","DOI":"10.2168\/LMCS-9(4:9)2013"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(92)90062-K","volume":"101","author":"A. Goerdt","year":"1992","unstructured":"Goerdt, A.: Characterizing complexity classes by general recursive definitions in higher types. Inf. Comput.\u00a0101(2), 202\u2013218 (1992)","journal-title":"Inf. Comput."},{"issue":"1","key":"13_CR14","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."},{"issue":"1-2","key":"13_CR15","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. Theor. Comput. Sci.\u00a0318(1-2), 139\u2013161 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR16","unstructured":"Terese (ed.): Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol.\u00a055. Cambridge University Press (2003)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Jones, N.D.: Computability and complexity: from a programming perspective. The MIT Press (1997)","DOI":"10.7551\/mitpress\/2003.001.0001"}],"container-title":["Lecture Notes in Computer Science","Rewriting and Typed Lambda Calculi"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08918-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T05:59:33Z","timestamp":1558936773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08918-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319089171","9783319089188"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08918-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}