{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:39:24Z","timestamp":1725525564269},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540926863"},{"type":"electronic","value":"9783540926870"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92687-0_17","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T04:25:38Z","timestamp":1234239938000},"page":"246-264","source":"Crossref","is-referenced-by-count":0,"title":["Light Linear Logic with Controlled Weakening"],"prefix":"10.1007","author":[{"given":"Max","family":"Kanovich","sequence":"first","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Asperti, A.: Light affine logic. In: Proceedings of LICS 1998 (1998)","key":"17_CR1","DOI":"10.1109\/LICS.1998.705666"},{"issue":"1","key":"17_CR2","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 (TOCL)\u00a03(1), 137\u2013175 (2002)","journal-title":"ACM Transactions on Computational Logic (TOCL)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/11874683_10","volume-title":"Computer Science Logic","author":"V. Atassi","year":"2006","unstructured":"Atassi, V., Baillot, P., Terui, K.: Verification of Ptime reducibility for system F terms via Dual Light Affine Logic. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 150\u2013166. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Baillot, P., Terui, K.: Light types for polynomial time computation in lambda-calculus. In: Proceedings of LICS 2004, pp. 266\u2013275 (2004)","key":"17_CR4","DOI":"10.1109\/LICS.2004.1319621"},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theoretical Computer Science\u00a050(1), 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(92)90386-T","volume":"97","author":"J.-Y. Girard","year":"1992","unstructured":"Girard, J.-Y., Scedrov, A., Scott, P.: Bounded linear logic: A modular approach to polynomial time computability. Theoretical Computer Science\u00a097, 1\u201366 (1992)","journal-title":"Theoretical Computer Science"},{"key":"17_CR7","first-page":"1","volume-title":"Advances in Linear Logic, London Mathematical Society Lecture Notes","author":"J.-Y. Girard","year":"1995","unstructured":"Girard, J.-Y.: Linear logic: its syntax and semantics. In: Girard, J.-Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic, London Mathematical Society Lecture Notes, vol.\u00a0222, pp. 1\u201342. Cambridge University Press, Cambridge (1995)"},{"issue":"2","key":"17_CR8","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":"3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/S0304-3975(01)00177-3","volume":"294","author":"M. Kanovich","year":"2003","unstructured":"Kanovich, M., Okada, M., Scedrov, A.: Phase semantics for light linear logic. Theoretical Computer Science\u00a0294(3), 525\u2013549 (2003)","journal-title":"Theoretical Computer Science"},{"key":"17_CR10","first-page":"163","volume":"318","author":"Y. Lafont","year":"2004","unstructured":"Lafont, Y.: Soft Linear Logic and Polynomial Time. Theoretical Computer Science (special issue on Implicit Computational Complexity)\u00a0318, 163\u2013180 (2004)","journal-title":"Theoretical Computer Science (special issue on Implicit Computational Complexity)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-45208-9_4","volume-title":"Theoretical Computer Science","author":"H. Mairson","year":"2003","unstructured":"Mairson, H., 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)"},{"issue":"6","key":"17_CR12","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"},{"issue":"1\/2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.tcs.2003.10.017","volume":"318","author":"A.S. Murawski","year":"2004","unstructured":"Murawski, A.S., Ong, C.-H.L.: On an interpretation of safe recursion in light affine logic. Theoretical Computer Science\u00a0318(1\/2), 197\u2013223 (2004)","journal-title":"Theoretical Computer Science"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/3-540-48168-0_33","volume-title":"Computer Science Logic","author":"L. Roversi","year":"1999","unstructured":"Roversi, L.: A P-time completeness proof for light logics. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 469\u2013483. Springer, Heidelberg (1999)"},{"doi-asserted-by":"crossref","unstructured":"Terui, K.: Light affine lambda calculus and polytime strong normalization. In: Proceedings of LICS 2001, pp. 209\u2013220 (2001)","key":"17_CR15","DOI":"10.1109\/LICS.2001.932498"},{"unstructured":"Terui, K.: Light logic and polynomial time computation, PhD thesis, Keio University (2002)","key":"17_CR16"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92687-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T03:43:30Z","timestamp":1551757410000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92687-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540926863","9783540926870"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92687-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}