A universal innocent game model for the Böhm tree lambda theory

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

Volumn 1683, Issue , 1999, Pages 405-419

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

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER CIRCUITS; DIFFERENTIATION (CALCULUS); FORESTRY; SEMANTICS;

EQUATIONAL THEORY; GAME MODELS; GAME SEMANTICS; UNIVERSAL MODEL; UNTYPED LAMBDA CALCULUS;

GAME THEORY;

EID: 84956863506     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48168-0_29     Document Type: Conference Paper

References (7)

1. Barendregt, H.: The Lambda Calculus, Its Syntax and Semantics. North-Holland, revised edition, 1984.
2. Di Gianantonio, P., Franco, G., Honsell, F.: Games Semantics for Untyped A-Calculus, Preprint, announced on the Types Mailing List. April 1998.
3. Hyland, J. M. E, Ong, C.-H. L.: On Full Abstraction for PCF: I, II and III. To appear in Information and Computation, 133 pages, ftp-able. 1994.
4. Ker, A., Nickau, H., Ong, C.-H. L.: Game Models of Untyped A-Calculus. Submitted for publication, 49 pages, ftp-able. 1998.
5. McCusker, G.: Games and Full Abstraction for a Functional Metalanguage with Recursive Types. Cambridge University Press, 1998.
6. Nakajima, R.: Infinite Normal Forms for the A-Calculus. In Goos, G. and Hartma-nis, J., editors, Symposium on A-Calculus and Computer Science, LNCS 37, pages 62-82. Springer-Verlag, 1975.
7. Nickau, H.: Hereditarily Sequential Functionals: A Game-Theoretic Approach to Sequentiality. Dissertation, Universitat GH Siegen. Shaker-Verlag, 1996.