{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T21:04:22Z","timestamp":1776373462705,"version":"3.51.2"},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":6419,"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":[[1996]]},"DOI":"10.1016\/s1571-0661(05)80398-6","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T15:34:43Z","timestamp":1115393683000},"page":"2-14","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":51,"special_numbering":"C","title":["Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions"],"prefix":"10.1016","volume":"3","author":[{"given":"Samson","family":"Abramsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"McCusker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80398-6_BIB1","article-title":"Axioms for full abstraction and full completeness","author":"Abramsky","year":"1996","journal-title":"Submitted for publication"},{"key":"10.1016\/S1571-0661(05)80398-6_BIB2","article-title":"Full abstraction for PCF","author":"Abramsky","year":"1996","journal-title":"Submitted for publication"},{"key":"10.1016\/S1571-0661(05)80398-6_BIB3","series-title":"Algebraic Semantics","first-page":"89","article-title":"Full abstraction for sequential languages: the state of the art","author":"Berry","year":"1986"},{"key":"10.1016\/S1571-0661(05)80398-6_BIB4","series-title":"International Conference on Typed Lambda Calculi and Applications","article-title":"What is a categorical model of intuitionistic linear logic?","author":"Bierman","year":"1995"},{"key":"10.1016\/S1571-0661(05)80398-6_BIB5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172707","article-title":"Categories for Types","author":"Crole","year":"1994"},{"key":"10.1016\/S1571-0661(05)80398-6_BIB6","article-title":"On full abstraction for PCF","author":"Hyland","year":"1996","journal-title":"Submitted for publication"},{"key":"10.1016\/S1571-0661(05)80398-6_BIB7","series-title":"PhD thesis, Imperial College, University of London","article-title":"Games and full Abstraction for a functional metalanguage with recursive types","author":"McCusker","year":"1996"},{"key":"10.1016\/S1571-0661(05)80398-6_BIB8","article-title":"Games and full abstraction for FPC","author":"McCusker","year":"1996","journal-title":"International Symposium on Logic in Computer Science"},{"key":"10.1016\/S1571-0661(05)80398-6_BIB9","series-title":"Logic Colloquium '73","first-page":"157","article-title":"Processes: a mathematical model of computing agents","author":"Milner","year":"1975"},{"key":"10.1016\/S1571-0661(05)80398-6_BIB10","series-title":"A Calculus of Communicating Systems","author":"Milner","year":"1980"},{"key":"10.1016\/S1571-0661(05)80398-6_BIB11","doi-asserted-by":"crossref","unstructured":"P. W. O'Hearn and U. Reddy. Objects, interference and the Yoneda embedding. In M. Main and S. Brookes, editors, Mathematical Foundations of Programming Semantics: Proceedings of 11th International Conference, Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers B.V., 1995.","DOI":"10.1016\/S1571-0661(04)00027-1"},{"key":"10.1016\/S1571-0661(05)80398-6_BIB12","series-title":"Algebraic Semantics","article-title":"Type categories, functor categories and block structure","author":"Oles","year":"1985"},{"key":"10.1016\/S1571-0661(05)80398-6_BIB13","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF considered as a programming language","volume":"5","author":"Plotkin","year":"1977","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80398-6_BIB14","article-title":"Global state considered unncessary: an object-based semantics for Algol","author":"Reddy","year":"1996","journal-title":"Lisp and Functional Programming"},{"key":"10.1016\/S1571-0661(05)80398-6_BIB15","first-page":"39","article-title":"Syntactic control of interference","author":"Reynolds","year":"1978","journal-title":"Conf. Record 5th ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/S1571-0661(05)80398-6_BIB16","series-title":"Algorithmic Languages","first-page":"345","article-title":"The essence of Algol","author":"Reynolds","year":"1981"},{"key":"10.1016\/S1571-0661(05)80398-6_BIB17","series-title":"Category theory, computer science and logic","article-title":"Linear logic, \u2217-autonomous categories and cofree coalgebras","author":"Seeley","year":"1987"},{"key":"10.1016\/S1571-0661(05)80398-6_BIB18","first-page":"169","article-title":"Denotational semantics","volume":"volume 3","author":"Tennent","year":"1994"},{"key":"10.1016\/S1571-0661(05)80398-6_BIB19","series-title":"Foundations of Computing","article-title":"The Formal Semantics of Programming Languages","author":"Winskel","year":"1993"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803986?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803986?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:08:59Z","timestamp":1761610139000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105803986"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"references-count":19,"alternative-id":["S1571066105803986"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80398-6","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions","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)80398-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}