{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:19:29Z","timestamp":1753438769456},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282310"},{"type":"electronic","value":"9783540318972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538363_13","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:35:33Z","timestamp":1127828133000},"page":"167-183","source":"Crossref","is-referenced-by-count":12,"title":["L-Nets, Strategies and Proof-Nets"],"prefix":"10.1007","author":[{"given":"Pierre-Louis","family":"Curien","sequence":"first","affiliation":[]},{"given":"Claudia","family":"Faggian","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511983504","volume-title":"Domains and Lambda-calculi","author":"R. Amadio","year":"1998","unstructured":"Amadio, R., Curien, P.-L.: Domains and Lambda-calculi. Cambridge University Press, Cambridge (1998)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Andreoli, J.-M.: Focussing and proof construction. Annals of Pure and Applied Logic (2001)","DOI":"10.1016\/S0168-0072(00)00032-4"},{"key":"13_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/3-540-45620-1_39","volume-title":"Automated Deduction - CADE-18","author":"J.-M. Andreoli","year":"2002","unstructured":"Andreoli, J.-M.: Focussing proof-net construction as a middleware paradigm. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, p. 501. Springer, Heidelberg (2002)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Curien, P.-L.: Abstract bohm trees. MSCS\u00a08(6) (1998)","DOI":"10.1017\/S0960129598002631"},{"key":"13_CR5","unstructured":"Curien, P.-L.: Introduction to linear logic and ludics, part ii. To appear in Advances of Mathematics, China (2004), Available at http:\/\/www.pps.jussieu.fr\/curien"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/3-540-45793-3_29","volume-title":"Computer Science Logic","author":"C. Faggian","year":"2002","unstructured":"Faggian, C.: Travelling on designs: ludics dynamics. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, p. 427. Springer, Heidelberg (2002)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-45793-3_30","volume-title":"Computer Science Logic","author":"C. Faggian","year":"2002","unstructured":"Faggian, C., Hyland, M.: Designs, disputes and strategies. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, p. 442. Springer, Heidelberg (2002)"},{"key":"13_CR8","volume-title":"Proc. of LICS (Logic in Computer Science)","author":"C. Faggian","year":"2005","unstructured":"Faggian, C., Maurel, F.: Ludics nets, a game model of concurrent interaction. In: Proc. of LICS (Logic in Computer Science), IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Girard, J.-Y.: Linear logic. Theoretical Computer Science\u00a0(50), 1\u2013102 (1987)","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"13_CR10","series-title":"NATO series F","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-3-642-58622-4_7","volume-title":"Computational logic","author":"J.-Y. Girard","year":"1999","unstructured":"Girard, J.-Y.: On the meaning of logical rules i: syntax vs. semantics. In: Berger, Schwichtenberg (eds.) Computational logic. NATO series F, vol.\u00a0165, pp. 215\u2013272. Springer, Heidelberg (1999)"},{"key":"13_CR11","first-page":"301","volume":"11","author":"J.-Y. Girard","year":"2001","unstructured":"Girard, J.-Y.: Locus solum. MSCS\u00a011, 301\u2013506 (2001)","journal-title":"MSCS"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Hughes, D., van Glabbeek, R.: Proof nets for unit-free multiplicative-additive linear logic. ACM Transactions on Computational Logic (2005)","DOI":"10.1145\/1094622.1094629"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Hyland, M., Ong, L.: On full abstraction for PCF. Information and Computation (2000)","DOI":"10.1006\/inco.2000.2917"},{"key":"13_CR14","unstructured":"Laurent, O.: Etude de la polarisation en logique. PhD thesis (2002)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538363_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:37Z","timestamp":1605644017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538363_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282310","9783540318972"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11538363_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}