{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:20Z","timestamp":1761610340154,"version":"build-2065373602"},"reference-count":41,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5323,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1999]]},"DOI":"10.1016\/s1571-0661(05)80312-3","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"127-150","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":14,"special_numbering":"C","title":["Abstract Games for Linear Logic Extended Abstract"],"prefix":"10.1016","volume":"29","author":[{"given":"Martin","family":"Hyland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Schalk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80312-3_BIB1","series-title":"Semantics and Logics of Computation","first-page":"1","article-title":"Semantics of interaction: an introduction to game semantics","author":"Abramsky","year":"1997"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB2","doi-asserted-by":"crossref","unstructured":"S. Abramsky and R. Jagadeesan. New foundations for the geometry of interaction. In Proceedings, Seventh Annual IEEE Symposium on Logic in Computer Science 1992, pages 211-222. IEEE Computer Science Press, Silver Spring, MD., 1992.","DOI":"10.1109\/LICS.1992.185534"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB3","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"},{"issue":"1","key":"10.1016\/S1571-0661(05)80312-3_BIB4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1006\/inco.1994.1041","article-title":"New foundations for the geometry of interaction","volume":"111","author":"Abramsky","year":"1994","journal-title":"Inf. and Comp."},{"key":"10.1016\/S1571-0661(05)80312-3_BIB5","unstructured":"S. Abramsky, R. Jagadeesan, and P. Malacaria. Games and full abstraction for PCF. Information and Computation. To appear."},{"key":"10.1016\/S1571-0661(05)80312-3_BIB6","first-page":"1","article-title":"Full abstraction for PCF (extended abstract)","author":"Abramsky","year":"1994","journal-title":"Theoretical Aspects of Computer Software: TACS '94, Sendai, Japan, volume 789 of LNCS"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB7","doi-asserted-by":"crossref","unstructured":"S. Abramsky and G. McCusker. Games and full abstraction for the lazy \u03bb-calculus. In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 234-243. IEEE Computer Society Press, 1995.","DOI":"10.1109\/LICS.1995.523259"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB8","series-title":"Algol-like languages","article-title":"Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions","author":"Abramsky","year":"1997"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB9","doi-asserted-by":"crossref","unstructured":"P. Baillot, V. Danos, T. Ehrhard, and L. Regnier. Believe it or not, AJM's games model is a model of classical linear logic. In Proceedings of the Twelfth Annual Symposium on Logic in Computer Science 1997, pages 68-75. IEEE Computer Society Press, 1997.","DOI":"10.1109\/LICS.1997.614933"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB10","doi-asserted-by":"crossref","unstructured":"P. Baillot, V. Danos, T. Ehrhard, and L. Regnier. Timeless games. In Proceedings of the tenth Workshop on Computer Science Logic, volume 1414 of LNCS. Springer Verlag, 1998.","DOI":"10.1007\/BFb0028007"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB11","doi-asserted-by":"crossref","unstructured":"M. Barr. \u229b-Autonomous categories. Number 752 in Lecture Notes in Mathematics. Springer-Verlag, 1979.","DOI":"10.1007\/BFb0064579"},{"issue":"2","key":"10.1016\/S1571-0661(05)80312-3_BIB12","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1017\/S0960129500001274","article-title":"\u2217-Autonomous categories and linear logic","volume":"1","author":"Barr","year":"1991","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB13","series-title":"PhD thesis, Columbia University","article-title":"Triples, Algebras, and Cohomology","author":"Beck","year":"1967"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB14","doi-asserted-by":"crossref","unstructured":"N. Benton, G. Bierman, V. de Paiva, and M. Hyland. Linear lambda-calculus and categorical models revisited. In Proceedings of the Sixth Workshop on Computer Science Logic, volume 702 of LNCS, pages 61-84. Springer Verlag, 1993.","DOI":"10.1007\/3-540-56992-8_6"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB15","doi-asserted-by":"crossref","unstructured":"N. Benton, G. Bierman, V. de Paiva, and M. Hyland. A term calculus for intuitionistic linear logic. In M. Bezem and J.F. Groote, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, TLCA'93, Utrecht, The Netherlands, 16-18 March 1993, volume 664 of LNCS, pages 75-90. Springer Verlag, 1993.","DOI":"10.1007\/BFb0037099"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB16","article-title":"On intuitionistic linear logic","author":"Bierman","year":"1994","journal-title":"Technical Report 346, University of Cambridge Computer Laboratory"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB17","doi-asserted-by":"crossref","unstructured":"G. M. Bierman. What is a categorical model of intuitionistic linear logic? In Proceedings of the Second International Conference on Typed Lambda Calculus, volume 902 of LNCS, pages 73-93, 1995.","DOI":"10.1007\/BFb0014046"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB18","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0168-0072(92)90073-9","article-title":"A game semantics for linear logic","volume":"56","author":"Blass","year":"1992","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB19","series-title":"Advances in Linear Logic","first-page":"61","article-title":"Questions and answers\u2014a category arising in linear logic, complexity theory and set theory","author":"Blass","year":"1995"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB20","unstructured":"P.-H. Chu. \u2217-Autonomous categories, chapter Constructing \u2217-autonomous categories. In Lecture Notes in Mathematics [11], 1979. (Appendix)."},{"key":"10.1016\/S1571-0661(05)80312-3_BIB21","series-title":"Birkh\u00e4user, 2nd edn. edition","article-title":"Categorical Combinators, Sequential Algorithms and Functional Programming","author":"Curien","year":"1993"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB22","series-title":"Category Theory and Computer Science, volume 389 of Lecture Notes in Computer Science","first-page":"341","article-title":"A dialectica-like model of linear logic","author":"de Paiva","year":"1989"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB23","unstructured":"J.-Y. Girard. Geometry of interaction 3: Accommodating the additives, ftp from ftp:\/\/iml.univ-mrs.fr\/pub\/girard\/as GOI3.ps.gz."},{"key":"10.1016\/S1571-0661(05)80312-3_BIB24","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":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB25","series-title":"International Conference on Computer Logic, COLOG88, volume 417 of LNCS","first-page":"76","article-title":"Geometry of interaction 2: Deadlock-free algorithms","author":"Girard","year":"1988"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB26","series-title":"Logic Colloquium 88.","article-title":"Geometry of interaction 1: Interpretation of System F","author":"Girard","year":"1989"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB27","series-title":"Categories in Computer Science and Logic, volume 92 of Contemporary Mathematics","first-page":"69","article-title":"Towards a geometry of interaction","author":"Girard","year":"1989"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB28","unstructured":"J.-Y. Girard. Linear logic: its syntax and semantics. In J.-Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in linear logic. London Mathematical Society Lecture Note Series, Cambridge University Press, 1995. Available by anonymous ftp from lmd.univ-mrs.fr as \/pub\/girard\/Synsem.ps.Z."},{"key":"10.1016\/S1571-0661(05)80312-3_BIB29","unstructured":"J.M.E. Hyland and C.-H.L. Ong. On Full Abstraction for PCF: I, II and III. Information and Computation. To appear."},{"year":"1993","series-title":"Fair games and full completeness for multiplicative linear logic without the mix-rule, ftp from ftp.comlab.ox.ac.uk as fcomplete.ps.gz in \/pub\/Documents\/techpapers\/Luke.Ong","author":"Hyland","key":"10.1016\/S1571-0661(05)80312-3_BIB30"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB31","series-title":"Semantics and Logics of Computation","first-page":"131","article-title":"Game semantics","author":"Hyland","year":"1997"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(93)90090-G","article-title":"Concrete domains","volume":"121","author":"Kahn","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB33","unstructured":"Y. Lafont and T. Streicher. Games semantics for linear logic. In Proc. Logic in Computer Science 1991. IEEE Computer Science Press, Silver Spring, MD., 1991."},{"key":"10.1016\/S1571-0661(05)80312-3_BIB34","series-title":"Proc. Logic in Computer Science 1997","first-page":"58","article-title":"Full abstraction for functional languages with control","author":"Laird","year":"1997"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB35","series-title":"Proc. Logic in Computer Science 1994. IEEE Computer Science Press","article-title":"Linear logic, totality, and full completeness","author":"Loader","year":"1994"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB36","series-title":"PhD thesis, St. Hugh's College, Oxford, Michaelmas","article-title":"Models of lambda calculi and linear logic: Structural, equational and proof-theoretic characterisations","author":"Loader","year":"1994"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB37","doi-asserted-by":"crossref","unstructured":"G. McCusker. Games and full abstraction for FPC. In Proceedings, Eleventh Annual IEEE Symposium on Logic in Computer Science, pages 174-183. IEEE Computer Society Press, 1996.","DOI":"10.1109\/LICS.1996.561316"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB38","doi-asserted-by":"crossref","unstructured":"H. Nickau. Hereditarily sequential functionals. In Proceedings of the Symposium of Logical Foundations of Computer Science, volume 813 of LNCS, pages 253-264. Springer Verlag, 1994.","DOI":"10.1007\/3-540-58140-5_25"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB39","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0022-4049(72)90019-9","article-title":"The formal theory of monads","volume":"2","author":"Street","year":"1972","journal-title":"Journal of Pure and Applied Algebra"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB40","series-title":"PhD thesis, University of Cambridge","article-title":"Full completeness for models of linear logic","author":"Tan","year":"1997"},{"key":"10.1016\/S1571-0661(05)80312-3_BIB41","series-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency, Advances in Petri Nets 1986, volume 255 of LNCS","first-page":"325","article-title":"Event structures","author":"Winskel","year":"1986"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803123?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803123?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:36Z","timestamp":1761610056000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105803123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":41,"alternative-id":["S1571066105803123"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80312-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Abstract Games for Linear Logic Extended Abstract","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80312-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}