{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:22:15Z","timestamp":1720624935216},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"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":3831,"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":[[2003,2]]},"DOI":"10.1016\/s1571-0661(04)80566-8","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"209-226","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["A Categorical Semantics of Higher Order Store"],"prefix":"10.1016","volume":"69","author":[{"given":"J.","family":"Laird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80566-8_NEWBIB1","series-title":"Essays in Honour of Robin Milner","article-title":"Axioms for full abstraction and full completeness","author":"Abramsky","year":"1997"},{"key":"10.1016\/S1571-0661(04)80566-8_NEWBIB2","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)80566-8_NEWBIB3","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)80566-8_NEWBIB4","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1006\/inco.2000.2930","article-title":"Full abstraction for PCF","volume":"163","author":"Abramsky","year":"2000","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80566-8_NEWBIB5","unstructured":"P. Baillot. Approches Dynamiques en Se\u1e3fantique de la Logique Lin\u00e9aire: Jeux et G\u00e9om\u00e9trie de l'Interaction. PhD thesis, Universit\u00e9 d'Aix-Marseille II, 1999."},{"key":"10.1016\/S1571-0661(04)80566-8_NEWBIB6","unstructured":"Josh Berdine, Peter W. O'Hearn, Uday S. Reddy, and Hayo Thielecke. Linearly used continuations. In Informal Proceedings of The Third ACM SIGPLAN Workshop on Continuations (CW'01), January 2001. To appear."},{"key":"10.1016\/S1571-0661(04)80566-8_NEWBIB7","doi-asserted-by":"crossref","unstructured":"G. Bierman. What is a categorical model of intuitionistic linear logic? In Proceedings of the Second International Conference on Typed Lambda Calculus, number 902 in LNCS, 1995.","DOI":"10.1007\/BFb0014046"},{"key":"10.1016\/S1571-0661(04)80566-8_NEWBIB8","doi-asserted-by":"crossref","unstructured":"D. Ghica and G. McCusker. Reasoning about Idealised Algol using regular languages. In Proceedings of the Twenty-Seventh International Colloquium on Automata, Languages and Programming (ICALP 2000), 2000.","DOI":"10.1007\/3-540-45022-X_10"},{"key":"10.1016\/S1571-0661(04)80566-8_NEWBIB9","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 Computer Society Press, 1998."},{"key":"10.1016\/S1571-0661(04)80566-8_NEWBIB10","doi-asserted-by":"crossref","unstructured":"M. Hasegawa. Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi. In Proceedings of TLCA '97, number 1210 in LNCS, pages 196\u2013213. Springer, 1997.","DOI":"10.1007\/3-540-62688-3_37"},{"key":"10.1016\/S1571-0661(04)80566-8_NEWBIB11","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":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80566-8_NEWBIB12","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1017\/S0305004100074338","article-title":"Traced monoidal categories","volume":"119","author":"Joyal","year":"1996","journal-title":"Math. Proc. Camb. Phil. Soc"},{"key":"10.1016\/S1571-0661(04)80566-8_NEWBIB13","unstructured":"J. Laird. A Semantic Analysis of Control. PhD thesis, Department of Computer Science, University of Edinburgh, 1998."},{"key":"10.1016\/S1571-0661(04)80566-8_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. IEEE Computer Society Press, 2001.","DOI":"10.1109\/LICS.2001.932487"},{"key":"10.1016\/S1571-0661(04)80566-8_NEWBIB15","doi-asserted-by":"crossref","unstructured":"J. Laird. A game semantics of ICSP. In Proceedings of MFPS XVII, number 45 in Electronic notes in Theoretical Computer Science. Elsevier, 2001.","DOI":"10.1016\/S1571-0661(04)80965-4"},{"key":"10.1016\/S1571-0661(04)80566-8_NEWBIB16","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)80566-8_NEWBIB17","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1006\/inco.1996.0052","article-title":"Relational properties of domains","volume":"127","author":"Pitts","year":"1996","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80566-8_NEWBIB18","doi-asserted-by":"crossref","DOI":"10.1017\/S0960129597002375","article-title":"Premonoidal categories and notions of computation","author":"Power","year":"1997","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(04)80566-8_NEWBIB19","unstructured":"U. Reddy. A linear logic model of state. Typescript, 1993."},{"key":"10.1016\/S1571-0661(04)80566-8_NEWBIB20","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"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805668?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805668?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T03:11:48Z","timestamp":1585883508000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805668"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":20,"alternative-id":["S1571066104805668"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80566-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}