{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:12:52Z","timestamp":1743109972000,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022722"},{"type":"electronic","value":"9783642022739"}],"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-02273-9_8","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T14:12:17Z","timestamp":1246025537000},"page":"80-94","source":"Crossref","is-referenced-by-count":9,"title":["Bounded Linear Logic, Revisited"],"prefix":"10.1007","author":[{"given":"Ugo","family":"Dal Lago","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Hofmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"8_CR1","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":"8_CR2","volume-title":"Studies in Logic and the Foundations of Mathematics","author":"H. Barendregt","year":"1984","unstructured":"Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics. In: Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam (1984)"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S. Bellantoni","year":"1992","unstructured":"Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the polytime functions. Computational Complexity\u00a02, 97\u2013110 (1992)","journal-title":"Computational Complexity"},{"key":"8_CR4","unstructured":"Dal Lago, U., Hofmann, M.: Bounded linear logic, revisited. Extended Version (2009), http:\/\/arxiv.org\/abs\/0904.2675"},{"issue":"1","key":"8_CR5","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. Information and Computation\u00a0183(1), 123\u2013137 (2003)","journal-title":"Information and Computation"},{"key":"8_CR6","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\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"8_CR7","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","key":"8_CR8","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), 1\u201366 (1992)","journal-title":"Theoretical Computer Science"},{"key":"8_CR9","first-page":"12","volume":"9","author":"M. Hofmann","year":"2000","unstructured":"Hofmann, M.: Programming languages capturing complexity classes. SIGACT News Logic Column\u00a09, 12 (2000)","journal-title":"SIGACT News Logic Column"},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0890-5401(03)00009-9","volume":"183","author":"M. Hofmann","year":"2003","unstructured":"Hofmann, M.: Linear types and non-size-increasing polynomial time computation. Information and Computation\u00a0183(1), 57\u201385 (2003)","journal-title":"Information and Computation"},{"issue":"1-2","key":"8_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.tcs.2003.10.019","volume":"318","author":"M. Hofmann","year":"2004","unstructured":"Hofmann, M., Scott, P.: Realizability models for BLL-like languages. Theoretical Computer Science\u00a0318(1-2), 121\u2013137 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"8_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. Theoretical Computer Science\u00a0318(1-2), 163\u2013180 (2004)","journal-title":"Theoretical Computer Science"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Leivant, D.: A foundational delineation of computational feasiblity. In: Sixth IEEE Symposium on Logic in Computer Science, Proceedings, pp. 2\u201311 (1991)","DOI":"10.1109\/LICS.1991.151625"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Leivant, D.: Stratified functional programs and computational complexity. In: 20th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Proceedings, pp. 325\u2013333 (1993)","DOI":"10.1145\/158511.158659"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-44404-1_3","volume-title":"Logic for Programming and Automated Reasoning","author":"J.-Y. Marion","year":"2000","unstructured":"Marion, J.-Y., Moyen, J.-Y.: Efficient first order functional program interpreter with time bound certifications. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS, vol.\u00a01955, pp. 25\u201342. Springer, Heidelberg (2000)"},{"issue":"1-2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.tcs.2003.10.017","volume":"318","author":"A. Murawski","year":"2004","unstructured":"Murawski, A., Ong, 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":"8_CR17","doi-asserted-by":"crossref","unstructured":"Sch\u00f6pp, U.: Stratified bounded affine logic for logarithmic space. In: 22nd IEEE Symposium on Logic in Computer Science, Proceedings, pp. 411\u2013420 (2007)","DOI":"10.1109\/LICS.2007.45"},{"key":"8_CR18","volume-title":"Basic proof theory","author":"A. Troelstra","year":"1996","unstructured":"Troelstra, A., Schwichtenberg, H.: Basic proof theory. Cambridge University Press, Cambridge (1996)"},{"key":"8_CR19","volume-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"C. Wadsworth","year":"1980","unstructured":"Wadsworth, C.: Some unusual \u03bb-calculus numeral systems. In: Seldin, J.P., Hindley, J.R. (eds.) To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism. Academic Press, London (1980)"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02273-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T11:58:07Z","timestamp":1739188687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02273-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022722","9783642022739"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02273-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}