{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T04:03:14Z","timestamp":1742443394932,"version":"3.40.1"},"reference-count":46,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2012,5,1]],"date-time":"2012-05-01T00:00:00Z","timestamp":1335830400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T00:00:00Z","timestamp":1462060800000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1016\/j.ic.2011.12.006","type":"journal-article","created":{"date-parts":[[2012,1,21]],"date-time":"2012-01-21T13:51:13Z","timestamp":1327153873000},"page":"119-155","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["An approach to innocent strategies as graphs"],"prefix":"10.1016","volume":"214","author":[{"given":"Pierre-Louis","family":"Curien","sequence":"first","affiliation":[]},{"given":"Claudia","family":"Faggian","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ic.2011.12.006_br0010","doi-asserted-by":"crossref","unstructured":"S. Abramsky, P.-A. Melli\u00e8s, Concurrent games and full completeness, in: Proceedings of the Fourteenth International Symposium on Logic in Computer Science, LICS, 1999, pp. 431\u2013442.","DOI":"10.1109\/LICS.1999.782638"},{"key":"10.1016\/j.ic.2011.12.006_br0020","unstructured":"M. Hyland, A category of partial orders and merging, 2001; oral communication at Rencontres Franco\u2013Am\u00e9ricaines de Math\u00e9matiques (AMS\u2013SMF)."},{"key":"10.1016\/j.ic.2011.12.006_br0030","series-title":"Proc. CONCUR\u02bc04","article-title":"Asynchronous games 2: The true concurrency of innocence","volume":"vol. 3170","author":"Melli\u00e8s","year":"2004"},{"key":"10.1016\/j.ic.2011.12.006_br0040","doi-asserted-by":"crossref","unstructured":"C. Faggian, F. Maurel, Ludics nets, a game model of concurrent interaction, in: Proc. of LICS\u02bc05, IEEE Computer Society Press, 2005.","DOI":"10.1109\/LICS.2005.25"},{"key":"10.1016\/j.ic.2011.12.006_br0050","doi-asserted-by":"crossref","unstructured":"M. Hyland, A. Schalk, Games on graphs and sequentially realizable functionals, in: LICS 02, IEEE, 2002 pp. 257\u2013264.","DOI":"10.1109\/LICS.2002.1029834"},{"key":"10.1016\/j.ic.2011.12.006_br0060","unstructured":"G. McCusker, M. Wall, Categorical and game semantics for SCIR, in: Proc. Galop\u02bc05 (Games for Logic and Programming Languages), workshop affiliated with Etaps\u02bc 05, 2005, pp. 157\u2013178."},{"key":"10.1016\/j.ic.2011.12.006_br0070","series-title":"CTCS 04","article-title":"Concrete data structures as games","volume":"vol. 122","author":"Schalk","year":"2005"},{"issue":"2\u20133","key":"10.1016\/j.ic.2011.12.006_br0080","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.tcs.2006.01.016","article-title":"Asynchronous games 2: The true concurrency of innocence","volume":"358","author":"Melli\u00e8s","year":"2006","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.ic.2011.12.006_br0090","series-title":"Proc. of CONCUR 2007","first-page":"395","article-title":"Asynchronous games: Innocence without alternation","volume":"vol. 4703","author":"Melli\u00e8s","year":"2007"},{"key":"10.1016\/j.ic.2011.12.006_br0100","doi-asserted-by":"crossref","unstructured":"S. Rideau, G. Winskel, Concurrent strategies, in: Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS, 2011, pp. 409\u2013418.","DOI":"10.1109\/LICS.2011.13"},{"key":"10.1016\/j.ic.2011.12.006_br0110","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1006\/inco.2000.2917","article-title":"On full abstraction for PCF: I, II, and III","volume":"163","author":"Hyland","year":"2000","journal-title":"Inform. and Comput."},{"key":"10.1016\/j.ic.2011.12.006_br0120","series-title":"CSL 05 (Computer Science Logic)","article-title":"L-nets, strategies and proof-nets","author":"Curien","year":"2005"},{"key":"10.1016\/j.ic.2011.12.006_br0130","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1017\/S096012950100336X","article-title":"Locus solum","volume":"11","author":"Girard","year":"2001","journal-title":"Math. Structures Comput. Sci."},{"key":"10.1016\/j.ic.2011.12.006_br0140","series-title":"CSL\u02bc02","article-title":"Designs, disputes and strategies","volume":"vol. 2471","author":"Faggian","year":"2002"},{"key":"10.1016\/j.ic.2011.12.006_br0150","first-page":"1","article-title":"Ludics with repetitions (exponentials, interactive types and completeness)","volume":"7","author":"Basaldella","year":"2011","journal-title":"Log. Methods Comput. Sci."},{"key":"10.1016\/j.ic.2011.12.006_br0160","doi-asserted-by":"crossref","DOI":"10.1017\/S0960129598002631","article-title":"Abstract B\u00f6hm trees","volume":"8","author":"Curien","year":"1998","journal-title":"Math. Structures Comput. Sci."},{"key":"10.1016\/j.ic.2011.12.006_br0170","article-title":"Introduction to linear logic and ludics, part II","volume":"35","author":"Curien","year":"2006","journal-title":"Adv. Math. (China)"},{"key":"10.1016\/j.ic.2011.12.006_br0180","doi-asserted-by":"crossref","first-page":"543","DOI":"10.2307\/2275407","article-title":"Games and full completeness for multiplicative linear logic","volume":"59","author":"Abramsky","year":"1994","journal-title":"J. Symbolic Logic"},{"year":"1998","series-title":"Domains and Lambda-Calculi","author":"Amadio","key":"10.1016\/j.ic.2011.12.006_br0190"},{"key":"10.1016\/j.ic.2011.12.006_br0200","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1145\/1094622.1094629","article-title":"Proof nets for unit-free multiplicative\u2013additive linear logic","volume":"6","author":"Hughes","year":"2005","journal-title":"ACM Trans. Comput. Log."},{"key":"10.1016\/j.ic.2011.12.006_br0210","unstructured":"S. Mimram, S\u00e9mantique des jeux asynchrones et r\u00e9\u00e9criture 2-dimensionnelle, PhD thesis, Paris 7 University, 2008."},{"key":"10.1016\/j.ic.2011.12.006_br0220","series-title":"Proceedings of Typed Lambda Calculi and Applications, TLCA","article-title":"Partial orders, event structures, and linear strategies","volume":"vol. 5608","author":"Faggian","year":"2007"},{"key":"10.1016\/j.ic.2011.12.006_br0230","unstructured":"M. Piccolo, Linearity and beyond in denotational semantics, PhD thesis, Univ. Torino \u2013 Univ. Paris 7, 2009."},{"key":"10.1016\/j.ic.2011.12.006_br0240","unstructured":"P. Di Giamberardino, Jump from parallel to sequential proofs: Additives, 2011, draft."},{"key":"10.1016\/j.ic.2011.12.006_br0250","series-title":"Logic and Algebra","article-title":"Proof-nets: the parallel syntax for proof-theory","author":"Girard","year":"1996"},{"issue":"1\u20133","key":"10.1016\/j.ic.2011.12.006_br0260","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0168-0072(00)00032-4","article-title":"Focussing and proof construction","volume":"107","author":"Andreoli","year":"2001","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/j.ic.2011.12.006_br0270","series-title":"Foundation of Secure Computation","first-page":"183","article-title":"On the meaning of logical rules II: multiplicative\/additive case","volume":"vol. 175","author":"Girard","year":"2000"},{"key":"10.1016\/j.ic.2011.12.006_br0280","series-title":"Computational Logic","first-page":"215","article-title":"On the meaning of logical rules I: syntax vs. semantics","volume":"vol. 165","author":"Girard","year":"1999"},{"key":"10.1016\/j.ic.2011.12.006_br0290","series-title":"Lectures on Logic","article-title":"The blind spot","author":"Girard","year":"2011"},{"key":"10.1016\/j.ic.2011.12.006_br0300","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.ic.2011.12.006_br0310","series-title":"CSL\u02bc02 (Computer Science Logic)","article-title":"Travelling on designs: ludics dynamics","volume":"vol. 2471","author":"Faggian","year":"2002"},{"key":"10.1016\/j.ic.2011.12.006_br0320","unstructured":"P.-L. Curien, Notes on game semantics, 2007, available from: http:\/\/www.pps.jussieu.fr\/~curien."},{"key":"10.1016\/j.ic.2011.12.006_br0330","series-title":"Proceedings of TLCA 2007","first-page":"148","article-title":"Ludics is a model for the finitary linear pi-calculus","volume":"vol. 4583","author":"Faggian","year":"2007"},{"key":"10.1016\/j.ic.2011.12.006_br0340","series-title":"Proceedings of TLCA 2001","first-page":"29","article-title":"Sequentiality and the \u03c0-calculus","volume":"vol. 2044","author":"Berger","year":"2001"},{"key":"10.1016\/j.ic.2011.12.006_br0350","doi-asserted-by":"crossref","unstructured":"J.-M. Andreoli, Focussing proof-net construction as a middleware paradigm, in: Proceedings of CADE\u02bc02 (Conference on Automated Deduction), 2002.","DOI":"10.1007\/3-540-45620-1_39"},{"key":"10.1016\/j.ic.2011.12.006_br0360","first-page":"222","article-title":"A tutorial on (co)algebras and (co)induction","volume":"62","author":"Jacobs","year":"1997","journal-title":"Bull. EATCS"},{"key":"10.1016\/j.ic.2011.12.006_br0370","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1093\/logcom\/exp044","article-title":"Intuitionistic dual\u2013intuitionistic nets","volume":"21","author":"Laurent","year":"2011","journal-title":"J. Logic Comput."},{"key":"10.1016\/j.ic.2011.12.006_br0380","series-title":"CSL\u02bc06 (Computer Science Logic)","article-title":"A jump from parallel to sequential proofs. Multiplicatives","volume":"vol. 4207","author":"Di Giamberardino","year":"2006"},{"key":"10.1016\/j.ic.2011.12.006_br0390","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.apal.2008.04.002","article-title":"Proof nets sequentialization in multiplicative linear logic","volume":"155","author":"Giamberardino","year":"2008","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/j.ic.2011.12.006_br0400","unstructured":"P. Di Giamberardino, Jump from parallel to sequential proofs: on polarities and sequentiality in linear logic, PhD thesis, Univ. Roma 3 \u2013 Univ. Aix-Marseille II, 2008."},{"key":"10.1016\/j.ic.2011.12.006_br0410","unstructured":"C. Faggian, M. Piccolo, A graph abstract machine describing event structure composition, in: GT \u2013 VC, Graph Transformation for Verification and Concurrency, ENTCS, 2006."},{"key":"10.1016\/j.ic.2011.12.006_br0420","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","article-title":"Event structures and domains 1","volume":"13","author":"Nielsen","year":"1981","journal-title":"Theoret. Comput. Sci."},{"issue":"19","key":"10.1016\/j.ic.2011.12.006_br0430","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2010.01.024","article-title":"Typed event structures and the pi-calculus","volume":"411","author":"Varacca","year":"2010","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.ic.2011.12.006_br0440","unstructured":"C. Faggian, Linear logic games: sequential and parallel, 2006, preprint."},{"key":"10.1016\/j.ic.2011.12.006_br0450","unstructured":"F. Maurel, Un cadre quantitatif pour la Ludique, PhD thesis, Universit\u00e9 de Paris 7, 2004."},{"key":"10.1016\/j.ic.2011.12.006_br0460","doi-asserted-by":"crossref","unstructured":"M. Basaldella, K. Terui, Infinitary completeness in ludics, in: LICS 2010, Symposium on Logic in Computer Science, IEEE Computer Society Press, 2010.","DOI":"10.1109\/LICS.2010.47"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540112000089?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540112000089?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T04:08:11Z","timestamp":1742357291000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540112000089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":46,"alternative-id":["S0890540112000089"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2011.12.006","relation":{},"ISSN":["0890-5401"],"issn-type":[{"type":"print","value":"0890-5401"}],"subject":[],"published":{"date-parts":[[2012,5]]}}}