{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:19:53Z","timestamp":1726409993083},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202165"},{"type":"electronic","value":"9783540452089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45208-9_18","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T04:49:20Z","timestamp":1277700560000},"page":"216-227","source":"Crossref","is-referenced-by-count":0,"title":["On the Expressive Power of Light Affine Logic"],"prefix":"10.1007","author":[{"given":"Ugo","family":"Dal Lago","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"18_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":"18_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"},{"key":"18_CR3","unstructured":"Baillot, P.: Stratified coherent spaces: a denotational semantics for light linear logic. Presented at the Second International Workshop on Implicit Computational Complexity (2000)"},{"issue":"1","key":"18_CR4","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"},{"issue":"1","key":"18_CR5","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.J.: Bounded linear logic: A modular approach to polynomial time computability. Theoretical Computer Science\u00a097(1), 1\u201366 (1992)","journal-title":"Theoretical Computer Science"},{"key":"18_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":"18_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"},{"key":"18_CR8","unstructured":"Lafont, Y.: Soft linear logic and polynomial time. To appear in Theoretical Computer Science (2002)"},{"key":"18_CR9","unstructured":"Mairson, H., Neergard, P.M.: LAL is square: Representation and expressiveness in light affine logic. Presented at the Fourth International Workshop on Implicit Computational Complexity (2002)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Maurel, F.: Nondederministic light logics and NP-time. In: Proceedings of the 6th International Conference on Typed Lambda Calculi and Applications, pp. 241\u2013255 (2003)","DOI":"10.1007\/3-540-44904-3_17"},{"key":"18_CR11","unstructured":"Murawski, A., Ong, L.: Can safe recursion be interpreted in light logic? Presented at the Second International Workshop on Implicit Computational Complexity (2000)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Murawski, A., Ong, L.: Evolving games and essential nets for affine polymorphism. In: Proceedings of 14th Annual Conference of the European Association of Computer Science Logic, pp. 360\u2013375 (2000)","DOI":"10.1007\/3-540-45413-6_28"},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1142\/S0129054100000077","volume":"11","author":"L. Roversi","year":"2000","unstructured":"Roversi, L.: Light affine logic as a programming language: a first contribution. International Journal of Foundations of Computer Science\u00a011(1), 113\u2013152 (2000)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"18_CR14","unstructured":"Terui, K.: Light logic and polynomial time computation. PhD thesis, Keio University (2002)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45208-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T13:40:48Z","timestamp":1559223648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45208-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202165","9783540452089"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45208-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}