Adapting innocent game models for the Böhm tree λ -theory

Theoretical Computer Science

Volumn 308, Issue 1-3, 2003, Pages 333-366

  Ker, Andrew D ^a   Nickau, Hanno ^a   Ong, C H Luke ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Effectively almost everywhere copycat; Game semantics; Innocent strategies; Untyped calculus

Indexed keywords

GAME THEORY; MATHEMATICAL MODELS; SEMANTICS;

GAME SEMANTICS;

COMPUTER SCIENCE;

EID: 0142124720     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00849-6     Document Type: Article

References (18)

1. Abramsky S., Jagadeesan R., Malacaria P. Full abstraction for PCF. Information and Computation. 163:2000;409-470.
2. S. Abramsky, G.A. McCusker, Games and full abstraction for the lazy λ -calculus, In: Proceedings, Tenth Ann. IEEE Sym. on Logic in Computer Science, IEEE Computer Society Press, 1995, 234-243.
3. Abramsky S., Ong C.-H.L. Full abstraction in the lazy lambda calculus. Information and Computation. 105:1993;159-267.
4. H.P. Barendregt, The Lambda Calculus, Its Syntax and Semantics, 103, Studies in Logic and the Foundations of Mathematics, of North-Holland, Amsterdam, 1984.
5. Berarducci A., Dezani-Ciancaglini M. Infinite. λ -calculus and types Theore. Comput. Sci. 212:1999;29-75.
6. P. Di Gianantonio, Game semantics of the pure lazy λ -calculus, In: Proc. Typed Lambda Calculus and Applications, 5th Internat. Conf. TLCA 2001, Krakow, Poland, May 2-5, 2001, Vol. 2044, Lecture Notes in Computer Science, Springer, Berlin, 2001, pp. 106-120.
7. P. Di Gianantonio, G. Franco, F. Honsell, Game semantics for untyped λβη -calculus, Vol. 1581, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1999, pp. 114-128.
8. Hyland J.M.E., Ong C.-H.L. On full abstraction for PCF: I, II and III, Inform. Comput. 163:2000;285-408.
9. A.D. Ker, Innocent Game Models of Untyped Lambda Calculus. PhD Thesis, University of Oxford, 2001.
10. Kennaway J.R., Klop J.W., Sleep M.R., de Vries F.J. Infinitary lambda calculus. Theore. Comput. Sci. 175:1997;93-125.
11. A.D. Ker, H. Nickau, C.-H.L. Ong, A universal innocent game model of the Böhm 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-419.
12. Ker A.D., Nickau H., Ong C.-H.L. Innocent game models of untyped. λ -calculus Theoret. Comput. Sci. 272:2002;247-292.
13. J. Lambek, P.J. Scott, Introduction to higher order categorical logic, Vol. 7, Cambridge Studies in Advanced Mathematics, of Cambridge University Press, Cambridge, 1986.
14. G.A. McCusker, Games and full abstraction for a functional metalanguage with recursive types. Distinguished Dissertations in Computer Science. Springer, Berlin, 1998.
15. R. Nakajima, Infinite normal forms for the λ -calculus, In: C. Böhm, (edi.), Proc. Symp. on λ -calculus and Computer Science Theory, Vol. 37, Lecture Notes in Computer Science, Springer, Berlin, 1975, pp. 62-82.
16. Hanno Nickau, Hereditarily sequential functionals: a game-theoretic approach to sequentiality. Shaker, 1996. Dissertation, Universität Gesamthochschule Siegen.
17. 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álaga, Spain, July 2002, volume 2380 of Lecture Notes in Computer Science, Springer, Berlin, 2002, pp. 476-487.
18. C.-H.L. Ong, The lazy lambda calculus: an investigation into the foundations of functional programming, Ph.D. Thesis, University of London, 1988.