{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T09:28:23Z","timestamp":1763544503559},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212980"},{"type":"electronic","value":"9783540247272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24727-2_4","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:06:41Z","timestamp":1280761601000},"page":"27-41","source":"Crossref","is-referenced-by-count":23,"title":["Soft lambda-Calculus: A Language for Polynomial Time Computation"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Baillot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Virgile","family":"Mogbil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(93)90181-R","volume":"111","author":"S. Abramsky","year":"1993","unstructured":"Abramsky, S.: Computational interpretations of linear logic. Theoretical Computer Science\u00a0111, 3\u201357 (1993)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/504077.504081","volume":"3","author":"A. Asperti","year":"2002","unstructured":"Asperti, A., Roversi, L.: Intuitionistic light affine logic (proof-nets, normalization complexity, expressive power). ACM Transactions on Computational Logic\u00a03(1), 1\u201339 (2002)","journal-title":"ACM Transactions on Computational Logic"},{"key":"4_CR3","volume-title":"Proceedings LICS 1998","author":"A. Asperti","year":"1998","unstructured":"Asperti, A.: Light affine logic. In: Proceedings LICS 1998, IEEE Computer Society, Los Alamitos (1998)"},{"key":"4_CR4","volume-title":"Proceedings of International IFIP Conference on Theoretical Computer Science 2002","author":"P. Baillot","year":"2002","unstructured":"Baillot, P.: Checking polynomial time complexity with types. In: Proceedings of International IFIP Conference on Theoretical Computer Science 2002, Montreal, Kluwer Academic Press, Dordrecht (2002)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0037099","volume-title":"Typed Lambda Calculi and Applications","author":"P.N. Benton","year":"1993","unstructured":"Benton, P.N., Bierman, G.M., de Paiva, V.C.V., Hyland, J.M.E.: A term calculus for intuitionistic linear logic. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol.\u00a0664, Springer, Heidelberg (1993)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S. Bellantoni","year":"1992","unstructured":"Bellantoni, S., Cook, S.: New recursion-theoretic characterization of the polytime functions. Computational Complexity\u00a02, 97\u2013110 (1992)","journal-title":"Computational Complexity"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Bellantoni, S., Niggl, K.-H., Schwichtenberg, H.: Higher type recursion, ramification and polynomial time. Annals of Pure and Applied Logic\u00a0104(1-3) (2000)","DOI":"10.1016\/S0168-0072(00)00006-3"},{"key":"4_CR8","unstructured":"Dal Lago, U., Martini, S.: Phase semantics and decidability results for elementary and soft linear logics (2003) (submitted)"},{"key":"4_CR9","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"},{"key":"4_CR10","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, 175\u2013204 (1998)","journal-title":"Information and Computation"},{"key":"4_CR11","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":"4_CR12","volume-title":"Proceedings LICS 1999","author":"M. Hofmann","year":"1999","unstructured":"Hofmann, M.: Linear types and non-size-increasing polynomial time computation. In: Proceedings LICS 1999, IEEE Computer Society, Los Alamitos (1999)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Hofmann, M.: Safe recursion with higher types and BCK-algebra. Annals of Pure and Applied Logic\u00a0104(1-3) (2000)","DOI":"10.1016\/S0168-0072(00)00010-5"},{"key":"4_CR14","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2003.001.0001","volume-title":"Computability and complexity, from a programming perspective","author":"N. Jones","year":"1997","unstructured":"Jones, N.: Computability and complexity, from a programming perspective. MIT Press, Cambridge (1997)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Lafont, Y.: Soft linear logic and polynomial time. In: Theoretical Computer Science (2004) (to appear)","DOI":"10.1016\/j.tcs.2003.10.018"},{"key":"4_CR16","first-page":"320","volume-title":"Feasible Mathematics II","author":"D. Leivant","year":"1994","unstructured":"Leivant, D.: Predicative recurrence and computational complexity I: word recurrence and poly-time. In: Feasible Mathematics II, pp. 320\u2013343. Birkhauser, Basel (1994)"},{"key":"4_CR17","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 characterisations of polytime. Fundamenta Informaticae\u00a019, 167\u2013184 (1993)","journal-title":"Fundamenta Informaticae"},{"key":"4_CR18","unstructured":"Marion, J.-Y.: Complexit\u00e9 implicite des calculs, de la th\u00e9orie \u00e0 la pratique. PhD thesis, Universit\u00e9 de Nancy, Habilitation \u00e0 diriger les recherches (2000)"},{"key":"4_CR19","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)"},{"key":"4_CR20","volume-title":"Proceedings LICS 2001","author":"K. Terui","year":"2001","unstructured":"Terui, K.: Light Affine Lambda-calculus and polytime strong normalization. In: Proceedings LICS 2001, IEEE Computer Society, Los Alamitos (2001)"},{"key":"4_CR21","unstructured":"Terui, K.: Light Logic and Polynomial Time Computation. PhD thesis, Keio University (2002)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24727-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T18:15:59Z","timestamp":1635876959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24727-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212980","9783540247272"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24727-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}