{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:24:44Z","timestamp":1753439084644},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540454588"},{"type":"electronic","value":"9783540454595"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11874683_21","type":"book-chapter","created":{"date-parts":[[2006,9,27]],"date-time":"2006-09-27T13:47:26Z","timestamp":1159364846000},"page":"319-333","source":"Crossref","is-referenced-by-count":6,"title":["Jump from Parallel to Sequential Proofs: Multiplicatives"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Di Giamberardino","sequence":"first","affiliation":[]},{"given":"Claudia","family":"Faggian","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48242-3_20","volume-title":"Logic Programming and Automated Reasoning","author":"J.-M. Andreoli","year":"1999","unstructured":"Andreoli, J.-M., Maieli, R.: Focusing and Proof nets in Linear and Non-Commutative Logic. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS, vol.\u00a01705. Springer, Heidelberg (1999)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Andreoli, J.-M.: Logic Programming with Focusing Proofs in Linear Logic. Journal of Logic and Computation\u00a02(3) (1992)","DOI":"10.1093\/logcom\/2.3.297"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","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, vol.\u00a02392. Springer, Heidelberg (2002)"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0168-0072(94)00033-Y","volume":"73","author":"R. Banach","year":"1995","unstructured":"Banach, R.: Sequent reconstruction in MLL - A sweepline proof. Annals of pure and applied logic\u00a073, 277\u2013295 (1995)","journal-title":"Annals of pure and applied logic"},{"key":"21_CR5","unstructured":"Curien, P.-L., Faggian, C.: An approach to innocent strategies as graphs. Journal (submitted)"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/11538363_13","volume-title":"Computer Science Logic","author":"P.-L. Curien","year":"2005","unstructured":"Curien, P.-L., Faggian, C.: L-Nets, Strategies and Proof-Nets. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 167\u2013183. Springer, Heidelberg (2005)"},{"key":"21_CR7","unstructured":"Danos, V.: La Logique Lin\u00e9aire appliqu\u00e9e l\u00e9tude de de divers processus de normalisation (principalement du \u03bb-calcul). PhD thesis, Universit\u00e9 Paris 7 (1990)"},{"key":"21_CR8","volume-title":"Proc. of LICS 2005 (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 2005 (Logic in Computer Science). IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"21_CR9","unstructured":"Girard, J.-Y.: Le Point Aveugle, Tome I and II. In: Hermann (ed.) Cours de th\u00e9orie de la d\u00e9monstration, Roma Tre (Octobre-D\u00e9cembre 2004), available at: \n                    \n                      http:\/\/logica.uniroma3.it\/uif\/corso"},{"key":"21_CR10","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":"21_CR11","unstructured":"Girard, J.-Y.: Quantifiers in Linear Logic II. In: Nuovi problemi della Logica e della Filosofia della scienza (1991)"},{"key":"21_CR12","series-title":"NATO series F 175","first-page":"183","volume-title":"Foundation of Secure Computation","author":"J.-Y. Girard","year":"2000","unstructured":"Girard, J.-Y.: On the meaning of logical rules II: multiplicative\/additive case. In: Foundation of Secure Computation. NATO series F 175, pp. 183\u2013212. IOS Press, Amsterdam (2000)"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1017\/S096012950100336X","volume":"11","author":"J.-Y. Girard","year":"2001","unstructured":"Girard, J.-Y.: Locus Solum. Mathematical Structures in Computer Science\u00a011, 301\u2013506 (2001)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"1-3","key":"21_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.apal.2004.04.006","volume":"130","author":"O. Laurent","year":"2004","unstructured":"Laurent, O.: Polarized Games. Annals of Pure and Applied Logic\u00a0130(1-3), 79\u2013123 (2004)","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11874683_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T04:42:14Z","timestamp":1552452134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11874683_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540454588","9783540454595"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11874683_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}