{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:27:30Z","timestamp":1725571650097},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255932"},{"type":"electronic","value":"9783540320142"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11417170_11","type":"book-chapter","created":{"date-parts":[[2010,12,16]],"date-time":"2010-12-16T19:29:35Z","timestamp":1292527775000},"page":"131-145","source":"Crossref","is-referenced-by-count":7,"title":["Elementary Affine Logic and the Call-by-Value Lambda Calculus"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Coppola","sequence":"first","affiliation":[]},{"given":"Ugo","family":"Dal Lago","sequence":"additional","affiliation":[]},{"given":"Simona Ronchi","family":"Della Rocca","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"11_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"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Asperti, A.: Light affine logic. In: Proceedings of the 13th IEEE Syposium on Logic in Computer Science, pp. 300\u2013308 (1998)","DOI":"10.1109\/LICS.1998.705666"},{"issue":"1","key":"11_CR3","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":"11_CR4","doi-asserted-by":"crossref","unstructured":"Baillot, P., Terui, K.: Light types for polynomial time computation in lambda-calculus. In: Proceedings of the 19th IEEE Syposium on Logic in Computer Science, pp. 266\u2013275 (2004)","DOI":"10.1109\/LICS.2004.1319621"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Coppola, P., Martini, S.: Typing lambda terms in elementary logic with linear constraints. In: Proceedings of the 6th International Conference on Typed Lambda-Calculus and Applications, pp. 76\u201390 (2001)","DOI":"10.1007\/3-540-45413-6_10"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Coppola, P., Ronchi della Rocca, S.: Principal typing in elementary affine logic. In: Proceedings of the 7th International Conference on Typed Lambda-Calculus and Applications, pp. 90\u2013104 (2003)","DOI":"10.1007\/3-540-44904-3_7"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Terui, K.: Light affine lambda calculus and polytime strong normalization. In: Proceedings of the 16th IEEE Symposium on Logic in Computer Science, pp. 209\u2013220 (2001)","DOI":"10.1109\/LICS.2001.932498"},{"key":"11_CR8","unstructured":"Terui, K.: Light logic and polynomial time computation. PhD thesis, Keio University (2002)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Baillot, P.: Checking polynomial time complexity with types. In: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science (2002)","DOI":"10.1007\/978-0-387-35608-2_31"},{"key":"11_CR10","unstructured":"Coppola, P., Martini, S.: Optimizing optimal reduction, a type inference algorithm for elementary affine logic. ACM Transactions on Computational Logic (2004) (To appear)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Baillot, P., Mogbil, V.: Soft lambda-calculus: a language for polynomial time computation. In: Proceedings of the 7th International Conference on Foundations of Software Science and Computational Structures (2004)","DOI":"10.1007\/978-3-540-24727-2_4"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11417170_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T20:06:05Z","timestamp":1553285165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11417170_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255932","9783540320142"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11417170_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}