Games characterizing Levy-Longo trees

Theoretical Computer Science

Volumn 312, Issue 1, 2004, Pages 121-142

  Ong, C H L ^a   Di Gianantonio, P ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

Full abstraction; Game semantics; Lambda calculus; Levy Longo trees; Universality

Indexed keywords

GAME THEORY; MATHEMATICAL MODELS; SEMANTICS; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

GAME SEMANTICS; LEVY-LONGO TREES;

COMPUTER SCIENCE;

EID: 0347600642     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00405-5     Document Type: Conference Paper

References (15)

1. Abramsky S., Jagadeesan R., Malacaria P. Full abstraction for PCF. Inform. and Comput. 163:2000.
2. 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-243.
3. Abramsky S., Ong C.-H.L. Full abstraction in the Lazy Lambda Calculus. Inform. and Comput. 105:1993;159-267.
4. H. Barendregt, The Lambda Calculus, revised Edition, North-Holland, Amsterdam, 1984.
5. 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-202.
6. 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-120.
7. P. Di Gianantonio, G. Franco, F. Honsell, Game semantics for the untyped λβη -calculus, in: Proc. Internat. Conf. on Typed Lambda Calculus and Applications, Lecture Notes in Computer Science, Vol. 1591, Springer, Berlin, 1999, pp. 114-128.
8. Hyland J.M.E., Ong C.-H.L. On full abstraction for PCF. I. Models, observables and the full abstraction problem, II. Dialogue games and innocent strategies, III. A fully abstract and universal game model Inform. and Comput. 163:2000;285-408.
9. A.D. Ker, H. Nickau, C.-H.L. Ong, A universal innocent game model for the Böhm 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-419.
10. Ker A.D., Nickau H., Ong C.-H.L. Innocent game models of untyped. λ -calculus Theoret. Comput. Sci. 272:2002;247-292.
11. Levy J.-J. An algebraic interpretation of equality in some models of the lambda calculus. Böhm C. Lambda Calculus and Computer Science Theory. Lecture Notes in Computer Science. Vol. 37:1975;147-165 Springer, Berlin.
12. Longo G. Set-theoretical models of lambda calculus. theories, expansions and isomorphisms Ann. Pure Appl. Logic. 24:1983;153-188.
13. G. McCusker, Full abstraction by translation, in: Advances in Theory and Formal Methods of Computing, IC Press, Amsterdam, 1996.
14. McCusker G. Games for recursive types, BCS Distinguished Dissertation. 1998;Cambridge University Press, Cambridge.
15. Plotkin G.D. Call-by-name, call-by-value and the lambda calculus. Theoret. Comput. Sci. 1:1975;125-159.