{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:13:13Z","timestamp":1761610393612,"version":"build-2065373602"},"reference-count":12,"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)80317-2","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"209-239","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Exhausting Strategies, Joker Games and Full Completeness for IMLL with Unit (Preliminary Version)"],"prefix":"10.1016","volume":"29","author":[{"given":"A.S.","family":"Murawski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.-H.L.","family":"Ong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80317-2_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)80317-2_BIB2","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. Symb. Logic"},{"key":"10.1016\/S1571-0661(05)80317-2_BIB3","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)80317-2_BIB4","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)80317-2_BIB5","article-title":"Fair games and full completeness for Multiplicative Linear Logic without the MIX-rule","author":"Hyland","year":"1993","journal-title":"preprint"},{"key":"10.1016\/S1571-0661(05)80317-2_BIB6","unstructured":"J. M. E. Hyland and C.-H. L. Ong. On full abstraction for PCF: I, II and III. To appear in Information and Computation, ftp-able from Ong's homepage, 1997."},{"key":"10.1016\/S1571-0661(05)80317-2_BIB7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0022-4049(71)90013-2","article-title":"Coherence in closed categories","volume":"1","author":"Kelly","year":"1971","journal-title":"Journal of Pure and Applied Algebra"},{"key":"10.1016\/S1571-0661(05)80317-2_BIB8","doi-asserted-by":"crossref","unstructured":"T. W. Koh and C.-H. L. Ong. Type theories for autonomous and \u2217-autonomous categories: I. types theories and rewrite systems II. internal languages and coherence theorems, preprint, 65 pages, ftp-able from Ong's homepage, 1998.","DOI":"10.1016\/S1571-0661(05)80313-5"},{"key":"10.1016\/S1571-0661(05)80317-2_BIB9","doi-asserted-by":"crossref","unstructured":"T. W. Koh and C.-H. L. Ong. Explicit substitution internal languages for autonomous and \u2217-autonomous categories. To appear in the ENTCS Proceedings of Category Theory and Computer Science 1999, 34pp., ftp-able from Ong's homepage, 1999.","DOI":"10.1016\/S1571-0661(05)80313-5"},{"key":"10.1016\/S1571-0661(05)80317-2_BIB10","article-title":"Proof Nets for Intuitionistic Logic 1: Essential Nets","author":"Lamarche","year":"1994","journal-title":"Preprint ftp-able from Hypatia"},{"key":"10.1016\/S1571-0661(05)80317-2_BIB11","article-title":"A linear-time algorithm for verifying MLL proof nets via Lamarche's essential nets","author":"Murawski","year":"1999","journal-title":"Preprint, 8 pp., ftp-able from Ong's homepage"},{"key":"10.1016\/S1571-0661(05)80317-2_BIB12","series-title":"PhD thesis, Universit\u00e4t-Gesamthochschule-Siegen","article-title":"Hereditarily Sequential Functionals: A Game-Theoretic Approach to Sequentiality","author":"Nickau","year":"1996"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803172?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803172?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:29Z","timestamp":1761610049000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105803172"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":12,"alternative-id":["S1571066105803172"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80317-2","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":"Exhausting Strategies, Joker Games and Full Completeness for IMLL with Unit (Preliminary Version)","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)80317-2","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"}]}}