{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:22:19Z","timestamp":1720624939398},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4288,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s1571-0661(04)80965-4","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"232-257","source":"Crossref","is-referenced-by-count":18,"special_numbering":"C","title":["A Game Semantics of Idealized CSP"],"prefix":"10.1016","volume":"45","author":[{"given":"J.","family":"Laird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80965-4_NEWBIB1","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(04)80965-4_NEWBIB2","doi-asserted-by":"crossref","unstructured":"S. Abramsky and G. McCusker. Call-by-value games. In M. Neilsen and W. Thomas, editors, Computer Science Logic: 11th Annual workshop proceedings, LNCS, pages 1\u201317. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0028004"},{"key":"10.1016\/S1571-0661(04)80965-4_NEWBIB3","doi-asserted-by":"crossref","unstructured":"S. Abramsky, and P.-A. Mellies. Concurrent games and full completeness. In Proceedings of the 14th annual Symposium on Logic In Computer Science, LICS '99, 1999.","DOI":"10.1109\/LICS.1999.782638"},{"key":"10.1016\/S1571-0661(04)80965-4_NEWBIB4","doi-asserted-by":"crossref","unstructured":"S. Abramsky, K. Honda, G. McCusker. A fully abstract games semantics for general references. In Proceedings of the 13th Annual Symposium on Logic In Computer Science, LICS '98, 1998.","DOI":"10.1109\/LICS.1998.705669"},{"key":"10.1016\/S1571-0661(04)80965-4_NEWBIB5","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":"Journal of Symbolic Logic"},{"key":"10.1016\/S1571-0661(04)80965-4_NEWBIB6","author":"Abramsky","year":"1996","journal-title":"Full abstraction for PCF. Accepted for publication in Information and Computation"},{"key":"10.1016\/S1571-0661(04)80965-4_NEWBIB7","doi-asserted-by":"crossref","unstructured":"S. Brookes. Idealized CSP: Combining procedures with communicating processes. In Proceedings of MFPS '97, Electronic notes in Theoretical Computer Science. Elsevier-North Holland, 1997.","DOI":"10.1016\/S1571-0661(05)80169-0"},{"key":"10.1016\/S1571-0661(04)80965-4_NEWBIB8","unstructured":"R. Harmer and G. McCusker. A fully abstract games semantics for finite non-determinism. In Proceedings of the Fourteenth Annual Symposium on Logic in Computer Science, LICS '99. IEEE Press, 1998."},{"key":"10.1016\/S1571-0661(04)80965-4_NEWBIB9","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(80)90015-8","article-title":"A mathematical semantics for a non-deterministic typed \u03bb-calculus","volume":"11","author":"Hennessy","year":"1980","journal-title":"Theoretical Computer Science"},{"issue":"8","key":"10.1016\/S1571-0661(04)80965-4_NEWBIB10","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Communications of the ACM"},{"key":"10.1016\/S1571-0661(04)80965-4_NEWBIB11","doi-asserted-by":"crossref","unstructured":"K. Honda and N. Yoshida. Game theoretic analysis of call-by-value computation. In Proceedings of 24th International Colloquium on Automata, Languages and Programming, volume 1256 of Lecture Notes in Computer Science. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63165-8_180"},{"key":"10.1016\/S1571-0661(04)80965-4_NEWBIB12","unstructured":"J. M. E. Hyland, and C.-H. L. Ong. On full abstraction for PCF: I, II and III, 1995. To appear in Theoretical Computer Science."},{"key":"10.1016\/S1571-0661(04)80965-4_NEWBIB13","doi-asserted-by":"crossref","unstructured":"J. Laird. Full abstraction for functional languages with control. In Proceedings of the Twelfth International Symposium on Logic In Computer Science, LICS '97, 1997.","DOI":"10.1109\/LICS.1997.614931"},{"key":"10.1016\/S1571-0661(04)80965-4_NEWBIB14","doi-asserted-by":"crossref","unstructured":"J. Laird. A fully abstract game semantics of local exceptions. In Proceedings of the Sixteenth International Symposium on Logic In Computer Science, LICS '01, 2001. To appear.","DOI":"10.1109\/LICS.2001.932487"},{"key":"10.1016\/S1571-0661(04)80965-4_NEWBIB15","unstructured":"G. McCusker. Games and full abstraction for a functional metalanguage with recursive types. PhD thesis, Imperial College London, 1996."},{"key":"10.1016\/S1571-0661(04)80965-4_NEWBIB16","doi-asserted-by":"crossref","unstructured":"H. Nickau. Hereditarily sequential functionals. In Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at St. Petersburg, LNCS. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58140-5_25"},{"key":"10.1016\/S1571-0661(04)80965-4_NEWBIB17","unstructured":"J. Reppy. Higher Order Concurrency. PhD thesis, Cornell University, 1992."},{"key":"10.1016\/S1571-0661(04)80965-4_NEWBIB18","doi-asserted-by":"crossref","unstructured":"J. Reynolds. Syntactic control of interference. In Conf. Record 5th ACM Symposium on Principles of Programming Languages, pages 39\u201346, 1978.","DOI":"10.1145\/512760.512766"},{"key":"10.1016\/S1571-0661(04)80965-4_NEWBIB19","series-title":"Algorithmic Languages","first-page":"345","article-title":"The essence of Algol","author":"Reynolds","year":"1981"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104809654?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104809654?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T10:55:33Z","timestamp":1549191333000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104809654"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":19,"alternative-id":["S1571066104809654"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80965-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}