{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T10:10:10Z","timestamp":1746353410551,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44602-7_13","type":"book-chapter","created":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T01:18:40Z","timestamp":1408756720000},"page":"151-163","source":"Crossref","is-referenced-by-count":1,"title":["Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Baillot","sequence":"first","affiliation":[]},{"given":"Erika","family":"De Benedetti","sequence":"additional","affiliation":[]},{"given":"Simona","family":"Ronchi Della Rocca","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.tcs.2003.10.015","volume":"318","author":"P. Baillot","year":"2004","unstructured":"Baillot, P.: Stratified coherence spaces: a denotational semantics for light linear logic. Theor. Comput. Sci.\u00a0318(1-2), 29\u201355 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-25318-8_25","volume-title":"Programming Languages and Systems","author":"P. Baillot","year":"2011","unstructured":"Baillot, P.: Elementary linear logic revisited for polynomial time and an exponential time hierarchy. In: Yang, H. (ed.) APLAS 2011. LNCS, vol.\u00a07078, pp. 337\u2013352. Springer, Heidelberg (2011)"},{"key":"13_CR3","unstructured":"Baillot, P., De Benedetti, E., Ronchi Della Rocca, S.: Characterizing polynomial and exponential complexity classes in elementary lambda-calculus. Tech. rep., 31 pages (2014), http:\/\/hal.archives-ouvertes.fr\/hal-01015171"},{"key":"13_CR4","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"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Coppola, P., Dal Lago, U., Ronchi Della Rocca, S.: Light logics and the call-by-value lambda-calculus. Logical Methods in Computer Science\u00a04(4) (2008)","DOI":"10.2168\/LMCS-4(4:5)2008"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Dal Lago, U.: Context semantics, linear logic, and computational complexity. ACM Trans. Comput. Log.\u00a010(4) (2009)","DOI":"10.1145\/1555746.1555749"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.tcs.2009.07.045","volume":"411","author":"U. Lago Dal","year":"2010","unstructured":"Dal Lago, U., Masini, A., Zorzi, M.: Quantum implicit computational complexity. Theor. Comput. Sci.\u00a0411(2), 377\u2013409 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0890-5401(03)00010-5","volume":"183","author":"V. Danos","year":"2003","unstructured":"Danos, V., Joinet, J.B.: Linear logic and elementary time. Inf. Comput.\u00a0183(1), 123\u2013137 (2003)","journal-title":"Inf. Comput."},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/inco.1998.2700","volume":"143","author":"J.Y. Girard","year":"1998","unstructured":"Girard, J.Y.: Light linear logic. Inf. Comput.\u00a0143(2), 175\u2013204 (1998)","journal-title":"Inf. Comput."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Jones, N.D.: Computability and complexity - from a programming perspective. Foundations of computing series. MIT Press (1997)","DOI":"10.7551\/mitpress\/2003.001.0001"},{"issue":"1","key":"13_CR11","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."},{"issue":"1-2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.tcs.2003.10.018","volume":"318","author":"Y. Lafont","year":"2004","unstructured":"Lafont, Y.: Soft linear logic and polynomial time. Theor. Comput. Sci.\u00a0318(1-2), 163\u2013180 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Leivant, D.: Predicative recurrence and computational complexity I: word recurrence and poly-time. In: Feasible Mathematics II, pp. 320\u2013343. Birkhauser (1994)","DOI":"10.1007\/978-1-4612-2566-9_11"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Leivant, D.: Calibrating computational feasibility by abstraction rank. In: LICS, p. 345. IEEE Computer Society (2002)","DOI":"10.1109\/LICS.2002.1029842"},{"issue":"1\/2","key":"13_CR15","doi-asserted-by":"crossref","first-page":"167","DOI":"10.3233\/FI-1993-191-207","volume":"19","author":"D. Leivant","year":"1993","unstructured":"Leivant, D., Marion, J.Y.: Lambda-calculus characterizations of poly-time. Fundam. Inform.\u00a019(1\/2), 167\u2013184 (1993)","journal-title":"Fundam. Inform."},{"key":"13_CR16","unstructured":"Madet, A.: Implicit Complexity in Concurrent Lambda-Calculi. Ph.D. thesis, Universit\u00e9 Paris 7 (December 2012), http:\/\/tel.archives-ouvertes.fr\/tel-00794977"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-21691-6_13","volume-title":"Typed Lambda Calculi and Applications","author":"A. Madet","year":"2011","unstructured":"Madet, A., Amadio, R.M.: An elementary affine lambda-calculus with multithreading and side effects. In: Ong, L. (ed.) Typed Lambda Calculi and Applications. LNCS, vol.\u00a06690, pp. 138\u2013152. Springer, Heidelberg (2011)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Marion, J.Y.: A type system for complexity flow analysis. In: LICS, pp. 123\u2013132. IEEE Computer Society (2011)","DOI":"10.1109\/LICS.2011.41"},{"issue":"6","key":"13_CR19","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1017\/S0960129506005688","volume":"16","author":"D. Mazza","year":"2006","unstructured":"Mazza, D.: Linear logic and polynomial time. Mathematical Structures in Computer Science\u00a016(6), 947\u2013988 (2006)","journal-title":"Mathematical Structures in Computer Science"},{"key":"13_CR20","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-10394-4","volume-title":"The Parametric Lambda-Calculus: a Metamodel for Computation","author":"S. Ronchi Della Rocca","year":"2004","unstructured":"Ronchi Della Rocca, S., Paolini, L.: The Parametric Lambda-Calculus: a Metamodel for Computation. Texts in Theoretical Computer Science. Springer, Berlin (2004), http:\/\/www.springer.com\/sgw\/cda\/frontpage\/0,5-40356-72-14202886-0,00.html"},{"issue":"3","key":"13_CR21","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1023\/A:1005092630115","volume":"59","author":"S. Ronchi Della Rocca","year":"1997","unstructured":"Ronchi Della Rocca, S., Roversi, L.: Lambda-calculus and intuitionistic linear logic. Studia Logica\u00a059(3), 417\u2013448 (1997)","journal-title":"Studia Logica"},{"issue":"3-4","key":"13_CR22","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s00153-007-0042-6","volume":"46","author":"K. Terui","year":"2007","unstructured":"Terui, K.: Light affine lambda-calculus and polynomial time strong normalization. Arch. Math. Log.\u00a046(3-4), 253\u2013280 (2007)","journal-title":"Arch. Math. Log."}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44602-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T09:40:53Z","timestamp":1746351653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44602-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44602-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}