{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:21:52Z","timestamp":1776316912278,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4184,"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":[[2002,2]]},"DOI":"10.1016\/s0304-3975(00)00353-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:11:15Z","timestamp":1027591875000},"page":"247-292","source":"Crossref","is-referenced-by-count":13,"title":["Innocent game models of untyped \u03bb-calculus"],"prefix":"10.1016","volume":"272","author":[{"given":"Andrew D.","family":"Ker","sequence":"first","affiliation":[]},{"given":"Hanno","family":"Nickau","sequence":"additional","affiliation":[]},{"given":"C.-H.","family":"Luke Ong","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00353-4_BIB1","first-page":"1","article-title":"Full abstraction for PCF (extended abstract)","volume":"vol. 789","author":"Abramsky","year":"1994"},{"key":"10.1016\/S0304-3975(00)00353-4_BIB2","doi-asserted-by":"crossref","unstructured":"S. Abramsky, G.A. McCusker, Games and full abstraction for the lazy \u03bb-calculus, Proc. 10th Annual IEEE Symp. on Logic in Computer Science, IEEE Computer Society Press, Silverspring, MD, 1995, pp. 234\u2013243.","DOI":"10.1109\/LICS.1995.523259"},{"key":"10.1016\/S0304-3975(00)00353-4_BIB3","volume":"vol. 103","author":"Barendregt","year":"1984"},{"key":"10.1016\/S0304-3975(00)00353-4_BIB4","first-page":"339","article-title":"Infinite lambda-calculus and non-sensible models","volume":"vol. 180","author":"Berarducci","year":"1996"},{"key":"10.1016\/S0304-3975(00)00353-4_BIB5","series-title":"Categories For Types, Cambridge Mathematical Textbooks","author":"Crole","year":"1993"},{"key":"10.1016\/S0304-3975(00)00353-4_BIB6","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","article-title":"Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation","volume":"41","author":"de Bruijn","year":"1972","journal-title":"Indag. Math."},{"key":"10.1016\/S0304-3975(00)00353-4_BIB7","article-title":"Games semantics for untyped \u03bb-calculus","volume":"vol. 1581","author":"Di Gianantonio","year":"1999"},{"issue":"2","key":"10.1016\/S0304-3975(00)00353-4_BIB8","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1112\/jlms\/s2-12.3.361","article-title":"A syntatic characterization of the equality in some models of the lambda calculus","volume":"2","author":"Hyland","year":"1976","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0304-3975(00)00353-4_BIB9","doi-asserted-by":"crossref","unstructured":"J.M.E. Hyland, C.-H.L. Ong, On full abstraction for PCF, Inform. and Comput., to appear, 2000.","DOI":"10.1006\/inco.2000.2917"},{"key":"10.1016\/S0304-3975(00)00353-4_BIB10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0304-3975(96)00171-5","article-title":"Infinitrary lambda calculus","volume":"175","author":"Kennaway","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00353-4_BIB11","unstructured":"A. Ker, Innocent game models of the untyped \u03bb-calculus, Ph.D. Thesis, University of Oxford, 2001."},{"key":"10.1016\/S0304-3975(00)00353-4_BIB12","first-page":"405","article-title":"A universal innocent game model of the B\u00f6hm tree lambda theory","volume":"vol. 1683","author":"Ker","year":"1999"},{"key":"10.1016\/S0304-3975(00)00353-4_BIB13","unstructured":"A. Ker, H. Nickau, C.-H.L. Ong, A universal innocent model of the B\u00f6hm tree lambda theory, Technical Report PRG-TR-10-00, Oxford University Computing Laboratory."},{"key":"10.1016\/S0304-3975(00)00353-4_BIB14","series-title":"Categories for the Working Mathematician","author":"Mac Lane","year":"1971"},{"key":"10.1016\/S0304-3975(00)00353-4_BIB15","series-title":"Games and Full Abstraction for a Functional Metalanguage with Recursive Types","author":"McCusker","year":"1988"},{"key":"10.1016\/S0304-3975(00)00353-4_BIB16","doi-asserted-by":"crossref","unstructured":"R. Nakajima, Infinite normal forms for the \u03bb-calculus, Proc. Symp. \u03bb-calculus and Computer Science Theory, Springer, Berlin, 1975, pp. 62\u201382.","DOI":"10.1007\/BFb0029519"},{"key":"10.1016\/S0304-3975(00)00353-4_BIB17","unstructured":"H. Nickau, Hereditarily Sequential Functionals: A Game-Theoretic Approach to Sequentiality, Shaker-Verlag, 1996. Dissertation, Universit\u00e4t Gesamthochschule Siegen, Shaker-Verlag, Aachen, 1996."},{"key":"10.1016\/S0304-3975(00)00353-4_BIB18","unstructured":"C.P. Wadsworth, Semantics and pragmatics of the \u03bb-calculus, Ph.D. Thesis, University of Oxford, 1971."},{"key":"10.1016\/S0304-3975(00)00353-4_BIB19","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0205036","article-title":"The relation between computational and denotational properties for Scott's D\u221e-models of the \u03bb-calculus","volume":"5","author":"Wadsworth","year":"1976","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003534?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003534?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T06:57:02Z","timestamp":1556866622000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500003534"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0304397500003534"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00353-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}