{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:58Z","timestamp":1725490258166},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749141"},{"type":"electronic","value":"9783540749158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74915-8_21","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T05:13:35Z","timestamp":1187932415000},"page":"253-267","source":"Crossref","is-referenced-by-count":13,"title":["A Soft Type Assignment System for \u03bb-Calculus"],"prefix":"10.1007","author":[{"given":"Marco","family":"Gaboardi","sequence":"first","affiliation":[]},{"given":"Simona","family":"Ronchi Della Rocca","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"21_CR1","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. Information and Computation\u00a0143(2), 175\u2013204 (1998)","journal-title":"Information and Computation"},{"issue":"1-2","key":"21_CR2","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. Theoretical Computer Science\u00a0318(1-2), 163\u2013180 (2004)","journal-title":"Theoretical Computer Science"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/978-3-540-24727-2_4","volume-title":"Foundations of Software Science and Computation Structures","author":"P. Baillot","year":"2004","unstructured":"Baillot, P., Mogbil, V.: Soft lambda-calculus: a language for polynomial time computation. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 27\u201341. Springer, Heidelberg (2004)"},{"key":"21_CR4","first-page":"266","volume-title":"Proceedings of LICS 2004","author":"P. Baillot","year":"2004","unstructured":"Baillot, P., Terui, K.: Light types for polynomial time computation in lambda-calculus. In: Proceedings of LICS 2004, pp. 266\u2013275. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"21_CR5","first-page":"300","volume-title":"Proceedings of LICS 1998","author":"A. Asperti","year":"1998","unstructured":"Asperti, A.: Light Affine Logic. In: Proceedings of LICS 1998, pp. 300\u2013308. IEEE Computer Society Press, Los Alamitos (1998)"},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/504077.504081","volume":"3","author":"A. Asperti","year":"2002","unstructured":"Asperti, A., Roversi, L.: Intuitionistic Light Affine Logic. ACM Transactions on Computational Logic\u00a03(1), 137\u2013175 (2002)","journal-title":"ACM Transactions on Computational Logic"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-3-540-45208-9_4","volume-title":"Theoretical Computer Science","author":"H.G. Mairson","year":"2003","unstructured":"Mairson, H.G., Terui, K.: On the Computational Complexity of Cut-Elimination in Linear Logic. In: Blundo, C., Laneve, C. (eds.) ICTCS 2003. LNCS, vol.\u00a02841, pp. 23\u201336. Springer, Heidelberg (2003)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Ronchi Della Rocca, S., Roversi, L.: Lambda calculus and Intuitionistic Linear Logic. Studia Logica\u00a059(3) (1997)","DOI":"10.1023\/A:1005092630115"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/11417170_11","volume-title":"Typed Lambda Calculi and Applications","author":"P. Coppola","year":"2005","unstructured":"Coppola, P., Dal Lago, U., Ronchi Della Rocca, S.: Elementary Affine Logic and the Call by Value Lambda Calculus. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol.\u00a03461, pp. 131\u2013145. Springer, Heidelberg (2005)"},{"key":"21_CR10","first-page":"209","volume-title":"Proceedings of LICS 2001","author":"K. Terui","year":"2001","unstructured":"Terui, K.: Light Affine Lambda Calculus and Polytime Strong Normalization. In: Proceedings of LICS 2001, pp. 209\u2013220. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"21_CR11","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H.P. Barendregt","year":"1984","unstructured":"Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. Elsevier\/North-Holland, Amsterdam, London, New York (1984)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74915-8_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:45:47Z","timestamp":1619520347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}