{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:21:53Z","timestamp":1776316913692,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"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":3582,"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":[[2003,11]]},"DOI":"10.1016\/s0304-3975(02)00849-6","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"333-366","source":"Crossref","is-referenced-by-count":6,"title":["Adapting innocent game models for the B\u00f6hm tree \u03bb-theory"],"prefix":"10.1016","volume":"308","author":[{"given":"Andrew D.","family":"Ker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanno","family":"Nickau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.-H.Luke","family":"Ong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00849-6_BIB1","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\/S0304-3975(02)00849-6_BIB2","doi-asserted-by":"crossref","unstructured":"S. Abramsky, G.A. McCusker, Games and full abstraction for the lazy \u03bb-calculus, In: Proceedings, Tenth Ann. IEEE Sym. on Logic in Computer Science, IEEE Computer Society Press, 1995, 234\u2013243.","DOI":"10.1109\/LICS.1995.523259"},{"key":"10.1016\/S0304-3975(02)00849-6_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":"Information and Computation"},{"key":"10.1016\/S0304-3975(02)00849-6_BIB4","doi-asserted-by":"crossref","unstructured":"H.P. Barendregt, The Lambda Calculus, Its Syntax and Semantics, 103, Studies in Logic and the Foundations of Mathematics, of North-Holland, Amsterdam, 1984.","DOI":"10.1016\/B978-0-444-87508-2.50006-X"},{"key":"10.1016\/S0304-3975(02)00849-6_BIB5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0304-3975(98)00135-2","article-title":"Infinite \u03bb-calculus and types","volume":"212","author":"Berarducci","year":"1999","journal-title":"Theore. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00849-6_BIB6","doi-asserted-by":"crossref","unstructured":"P. Di Gianantonio, Game semantics of the pure lazy \u03bb-calculus, In: Proc. Typed Lambda Calculus and Applications, 5th Internat. Conf. TLCA 2001, Krakow, Poland, May 2\u20135, 2001, Vol. 2044, Lecture Notes in Computer Science, Springer, Berlin, 2001, pp. 106\u2013120.","DOI":"10.1007\/3-540-45413-6_12"},{"key":"10.1016\/S0304-3975(02)00849-6_BIB7","doi-asserted-by":"crossref","unstructured":"P. Di Gianantonio, G. Franco, F. Honsell, Game semantics for untyped \u03bb\u03b2\u03b7-calculus, Vol. 1581, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1999, pp. 114\u2013128.","DOI":"10.1007\/3-540-48959-2_10"},{"key":"10.1016\/S0304-3975(02)00849-6_BIB8","first-page":"285","volume":"163","author":"Hyland","year":"2000","journal-title":"On full abstraction for PCF: I, II and III, Inform. Comput."},{"key":"10.1016\/S0304-3975(02)00849-6_BIB9","unstructured":"A.D. Ker, Innocent Game Models of Untyped Lambda Calculus. PhD Thesis, University of Oxford, 2001."},{"key":"10.1016\/S0304-3975(02)00849-6_BIB10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0304-3975(96)00171-5","article-title":"Infinitary lambda calculus","volume":"175","author":"Kennaway","year":"1997","journal-title":"Theore. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00849-6_BIB11","doi-asserted-by":"crossref","unstructured":"A.D. Ker, H. Nickau, C.-H.L. Ong, A universal innocent game model of the B\u00f6hm tree lambda theory, In: Computer Science Logic: Pro. 8th Ann. Conf. of the EACSL, Madrid, Spain, September 1999, Vol. 1683, Lecture Notes in Computer Science, Springer, Berlin, 1999, pp. 405\u2013419.","DOI":"10.1007\/3-540-48168-0_29"},{"key":"10.1016\/S0304-3975(02)00849-6_BIB12","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(02)00849-6_BIB13","unstructured":"J. Lambek, P.J. Scott, Introduction to higher order categorical logic, Vol. 7, Cambridge Studies in Advanced Mathematics, of Cambridge University Press, Cambridge, 1986."},{"key":"10.1016\/S0304-3975(02)00849-6_BIB14","doi-asserted-by":"crossref","unstructured":"G.A. McCusker, Games and full abstraction for a functional metalanguage with recursive types. Distinguished Dissertations in Computer Science. Springer, Berlin, 1998.","DOI":"10.1007\/978-1-4471-0615-9"},{"key":"10.1016\/S0304-3975(02)00849-6_BIB15","doi-asserted-by":"crossref","unstructured":"R. Nakajima, Infinite normal forms for the \u03bb-calculus, In: C. B\u00f6hm, (edi.), Proc. Symp. on \u03bb-calculus and Computer Science Theory, Vol. 37, Lecture Notes in Computer Science, Springer, Berlin, 1975, pp. 62\u201382.","DOI":"10.1007\/BFb0029519"},{"key":"10.1016\/S0304-3975(02)00849-6_BIB16","unstructured":"Hanno Nickau, Hereditarily sequential functionals: a game-theoretic approach to sequentiality. Shaker, 1996. Dissertation, Universit\u00e4t Gesamthochschule Siegen."},{"key":"10.1016\/S0304-3975(02)00849-6_BIB17","doi-asserted-by":"crossref","unstructured":"C.-H.L. Ong, P. Di Gianantonio, Games Characterizing Levy-Longo Trees, in: Widmayer et al. (Ed.), Proc. of 29th Internat. Colloq. on Automata, Languages and Programming (ICALP 2002), M\u00e1laga, Spain, July 2002, volume 2380 of Lecture Notes in Computer Science, Springer, Berlin, 2002, pp. 476\u2013487.","DOI":"10.1007\/3-540-45465-9_41"},{"key":"10.1016\/S0304-3975(02)00849-6_BIB18","doi-asserted-by":"crossref","unstructured":"C.-H.L. Ong, The lazy lambda calculus: an investigation into the foundations of functional programming, Ph.D. Thesis, University of London, 1988.","DOI":"10.1109\/SFCS.1988.21953"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502008496?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502008496?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T04:51:16Z","timestamp":1554180676000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502008496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S0304397502008496"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00849-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}