{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T11:30:47Z","timestamp":1776684647042,"version":"3.51.2"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0304-3975(03)00405-5","type":"journal-article","created":{"date-parts":[[2003,8,12]],"date-time":"2003-08-12T13:57:44Z","timestamp":1060696664000},"page":"121-142","source":"Crossref","is-referenced-by-count":5,"title":["Games characterizing Levy\u2013Longo trees"],"prefix":"10.1016","volume":"312","author":[{"given":"C.-H.L.","family":"Ong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Di Gianantonio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00405-5_BIB1","doi-asserted-by":"crossref","DOI":"10.1006\/inco.2000.2930","article-title":"Full abstraction for PCF","volume":"163","author":"Abramsky","year":"2000","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(03)00405-5_BIB2","doi-asserted-by":"crossref","unstructured":"S. Abramsky, G. McCusker, Games and full abstraction for the Lazy Lambda Calculus, in: Proc. 10th IEEE Symp. Logic in Computer Science, The Computer Society, 1995, pp. 234\u2013243.","DOI":"10.1109\/LICS.1995.523259"},{"key":"10.1016\/S0304-3975(03)00405-5_BIB3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/inco.1993.1044","article-title":"Full abstraction in the Lazy Lambda Calculus","volume":"105","author":"Abramsky","year":"1993","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(03)00405-5_BIB4","unstructured":"H. Barendregt, The Lambda Calculus, revised Edition, North-Holland, Amsterdam, 1984."},{"key":"10.1016\/S0304-3975(03)00405-5_BIB5","doi-asserted-by":"crossref","unstructured":"V. Danos, R. Harmer, The anatomy of innocence, in: Proc. 10th Annu. Conf. of the European Association for Computer Science Logic, Lecture Notes in Computer Science, Vol. 2142, Springer, Berlin, 2001, pp. 188\u2013202.","DOI":"10.1007\/3-540-44802-0_14"},{"key":"10.1016\/S0304-3975(03)00405-5_BIB6","doi-asserted-by":"crossref","unstructured":"P. Di Gianantonio, Game semantics for the pure lazy lambda calculus, in: Proc. 5th Internat. Conf. Typed Lambda Calculi and Applications, Krakow, Poland, May 2001, Springer, Berlin, 2001, pp. 106\u2013120.","DOI":"10.1007\/3-540-45413-6_12"},{"key":"10.1016\/S0304-3975(03)00405-5_BIB7","doi-asserted-by":"crossref","unstructured":"P. Di Gianantonio, G. Franco, F. Honsell, Game semantics for the untyped \u03bb\u03b2\u03b7-calculus, in: Proc. Internat. Conf. on Typed Lambda Calculus and Applications, Lecture Notes in Computer Science, Vol. 1591, Springer, Berlin, 1999, pp. 114\u2013128.","DOI":"10.1007\/3-540-48959-2_10"},{"key":"10.1016\/S0304-3975(03)00405-5_BIB8","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1006\/inco.2000.2917","article-title":"On full abstraction for PCF","volume":"163","author":"Hyland","year":"2000","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(03)00405-5_BIB9","doi-asserted-by":"crossref","unstructured":"A.D. Ker, H. Nickau, C.-H.L. Ong, A universal innocent game model for the B\u00f6hm tree lambda theory, in: Computer Science Logic: Proc. 8th Annu. Conf. on the EACSL Madrid, Spain, September 1999, Lecture Notes in Computer Science, Vol. 1683, Springer, Berlin, 1999, pp. 405\u2013419.","DOI":"10.1007\/3-540-48168-0_29"},{"key":"10.1016\/S0304-3975(03)00405-5_BIB10","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0304-3975(00)00353-4","article-title":"Innocent game models of untyped \u03bb-calculus","volume":"272","author":"Ker","year":"2002","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00405-5_BIB11","series-title":"Lambda Calculus and Computer Science Theory","first-page":"147","article-title":"An algebraic interpretation of equality in some models of the lambda calculus","volume":"Vol. 37","author":"Levy","year":"1975"},{"key":"10.1016\/S0304-3975(03)00405-5_BIB12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0168-0072(83)90030-1","article-title":"Set-theoretical models of lambda calculus","volume":"24","author":"Longo","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(03)00405-5_BIB13","unstructured":"G. McCusker, Full abstraction by translation, in: Advances in Theory and Formal Methods of Computing, IC Press, Amsterdam, 1996."},{"key":"10.1016\/S0304-3975(03)00405-5_BIB14","series-title":"Games for recursive types, BCS Distinguished Dissertation","author":"McCusker","year":"1998"},{"key":"10.1016\/S0304-3975(03)00405-5_BIB15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","article-title":"Call-by-name, call-by-value and the lambda calculus","volume":"1","author":"Plotkin","year":"1975","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503004055?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503004055?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T08:57:59Z","timestamp":1551085079000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503004055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0304397503004055"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00405-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}