{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:47:03Z","timestamp":1725536823546},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_30","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T10:43:03Z","timestamp":1250678583000},"page":"344-355","source":"Crossref","is-referenced-by-count":3,"title":["A By-Level Analysis of Multiplicative Exponential Linear Logic"],"prefix":"10.1007","author":[{"given":"Marco","family":"Gaboardi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Roversi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Vercelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"30_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. Inf. Comput.\u00a0143(2), 175\u2013204 (1998)","journal-title":"Inf. Comput."},{"key":"30_CR2","unstructured":"Baillot, P., Mazza, D.: Linear logic by levels and bounded time complexity. Accepted for publication in Theor. Comp. Sci. (2009)"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1017\/CBO9780511629150.010","volume-title":"Advances in Linear Logic","author":"S. Martini","year":"1995","unstructured":"Martini, S., Masini, A.: On the fine structure of the exponential rule. In: Girard, J.Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic, pp. 197\u2013210. Cambridge University Press, Cambridge (1995); Proceedings of the Workshop on Linear Logic"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Martini, S., Masini, A.: A computational interpretation of modal proofs. In: Wansing, H. (ed.) Proof Theory of Modal Logic, Dordrecht, vol.\u00a02, pp. 213\u2013241 (1996)","DOI":"10.1007\/978-94-017-2798-3_12"},{"issue":"3-4","key":"30_CR5","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. Logic\u00a046(3-4), 253\u2013280 (2007)","journal-title":"Arch. Math. Logic"},{"key":"30_CR6","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.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)"},{"issue":"6","key":"30_CR7","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":"30_CR8","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. Comp. Sci.\u00a0318, 163\u2013180 (2004)","journal-title":"Theor. Comp. Sci."},{"key":"30_CR9","series-title":"Studies in Logic and the Foundations of Math.","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1016\/S0049-237X(09)70143-0","volume-title":"Proc. of Brouwer Centenary Symp.","author":"H. Schwichtenberg","year":"1982","unstructured":"Schwichtenberg, H.: Complexity of normalization in the pure typed lambda-calculus. In: Troelstra, A.S., van Dalen, D. (eds.) Proc. of Brouwer Centenary Symp. Studies in Logic and the Foundations of Math., vol.\u00a0110, pp. 453\u2013457. North-Holland, Amsterdam (1982)"},{"issue":"13","key":"30_CR10","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.2307\/2695106","volume":"66","author":"A. Beckmann","year":"2001","unstructured":"Beckmann, A.: Exact bounds for lengths of reductions in typed lambda-calculus. J. Symb. Log.\u00a066(13), 1277\u20131285 (2001)","journal-title":"J. Symb. Log."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T08:09:09Z","timestamp":1552118949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}