{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:39Z","timestamp":1759638099954,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665366"},{"type":"electronic","value":"9783540481683"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48168-0_33","type":"book-chapter","created":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T11:30:26Z","timestamp":1196508626000},"page":"469-483","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A P-Time Completeness Proof for Light Logics"],"prefix":"10.1007","author":[{"given":"Luca","family":"Roversi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"33_CR1","unstructured":"A. Asperti. Light Affine Logic. In Proceedings of Symposium on Logic in Computer Science LICS\u201998, 1998."},{"key":"33_CR2","unstructured":"H.P. Barendregt. The Lambda Calculus. North-Holland, second edition, 1984."},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/inco.1998.2700","volume":"143","author":"J.-Y. Girard","year":"1998","unstructured":"J.-Y. Girard. Light Linear Logic. Information and Computation, 143:175\u2013204, 1998.","journal-title":"Information and Computation"},{"key":"33_CR4","volume-title":"Proofs and Types","author":"J.-Y. Girard","year":"1989","unstructured":"J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989."},{"key":"33_CR5","unstructured":"L. Roversi. Concrete syntax for intuitionistic light affine logic with polymorphic type assignment. In Sixth Italian Conference on Theoretical Computer Science. World Scientific, 9-11 November(Pr ato-Italy) 1998."},{"key":"33_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Computing Science-ASIAN\u201998","author":"L. Roversi","year":"1998","unstructured":"L. Roversi. A polymorphic language which is typable and poly-step. In Advances in Computing Science-ASIAN\u201998, volume LNCS 1538. Springer-Verlag, 8-10 December(Manila-The Philippines) 1998."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48168-0_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T04:09:39Z","timestamp":1586146179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48168-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665366","9783540481683"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-48168-0_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"13 May 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}