Games characterizing Levy-Longo trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 476-487

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

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CALCULATIONS; DIFFERENTIATION (CALCULUS);

GAME MODELS; LAMBDA CALCULUS;

FORESTRY;

EID: 84869161471     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_41     Document Type: Conference Paper

References (15)

1. S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Information and Computation, 163, 2000.
2. S. Abramsky and G. McCusker. Games and full abstraction for the Lazy Lambda Calculus. In Proc. LICS, pages 234-243. The Computer Society, 1995.
3. S. Abramsky and C.-H. L. Ong. Full abstraction in the Lazy Lambda Calculus. Information and Computation, 105:159-267, 1993.
4. H. Barendregt. The Lambda Calculus. North-Holland, revised edition, 1984.
5. V. Danos and R. Harmer. The anatomy of innocence. In Proc. CSL 2001, pages 188-202. Springer Verlag, 2001. LNCS Vol. 2142.
6. P. Di Gianantonio. Game semantics for the Pure Lazy Lambda Calculus. In Proc. TLCA2001, pages 106-120. Springer-Verlag, 2001.
7. P. Di Gianantonio, G. Franco, and F. Honsell. Game semantics for the untyped λβη-calculus. In Proc. TLCA1999, pages 114-128. Springer-Verlag, 1999. LNCS Vol. 1591.
8. J. M. E. Hyland and C.-H. L. Ong. 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. Information and Computation, 163:285-408, 2000.
9. A. D. Ker, H. Nickau, and C.-H. L. Ong. A universal innocent game model for the Böhm tree lambda theory. In Proc. CSL 1999, pages 405 - 419. Springer-Verlag, 1999. LNCS Volume 1683.
10. A. D. Ker, H. Nickau, and C.-H. L. Ong. Innocent game models of untyped λ-calculus. Theoretical Computer Science, 272:247-292, 2002.
11. J.-J. Levy. An algebraic interpretation of equality in some models of the lambda calculus. In C. Böhm, editor, Lambda Calculus and Computer Science Theory, pages 147-165. Springer-Verlag, 1975. LNCS No. 37.
12. G. Longo. Set-theoretical models of lambda calculus: Theories, expansions and isomorphisms. Annals of Pure and Applied Logic, 24:153-188, 1983.
13. G. McCusker. Full abstraction by translation. In Advances in Theory and Formal Methods of Computing. IC Press, 1996.
14. G. McCusker. Games for recursive types. BCS Distinguished Dissertation. Cambridge University Press, 1998.
15. G. D. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoretical Computer Science, 1:125-159, 1975.