Game semantics for the pure lazy λ-calculus

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

Volumn 2044 LNCS, Issue , 2001, Pages 106-120

  Di Gianantonio, Pietro ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; PATHOLOGY; SEMANTICS; COMPUTATIONAL MECHANICS;

ABSTRACT GAMES; GAME SEMANTICS; LAMBDA CALCULUS; ORDER RELATION;

DIFFERENTIATION (CALCULUS);

EID: 84888878403     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45413-6_12     Document Type: Conference Paper

References (11)

1. S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for pcf (extended abstract). In Theoretical Aspects of Computer software. International Symposium TACS '94, volume 789 of LNCS. Springer-Verlag, 1994.
2. S. Abramsky and G. McCusker. Games and full abstraction for the lazy A-calculus. In Proceedings LICS '95, 1995.
3. S. Abramsky and G. McCusker. Games for recursive types. In I. C. Mackie C. L. Hankin and R. Nagarajan, editors, Theory and Formal Methods of Computing 1994: Proceedings of the Second Imperial College Department of Computing Workshop on Theory and Formal Methods. Imperial College Press, October 1995.
4. S. Abramsky and C.H.L. Ong. Full abstraction in the lazy A-calculus. Information and Computation, 105:159-267, 1993.
5. O. Bastonero, A. Pravato, and S Ronchi. Structures for lazy semantics. In Programming Concepts and Methods, PROCOMET'98. Chapman & Hall, 1998.
6. P. Di Gianantonio and G. Franco. The fine structure of game lambda-models. In Conference on the Foundation of Software Technology and Theoretical Computer Science (FSTTS '00), volume 1974 of LNCS, pages 429-441. Springer-Verlag, 2000.
7. L. Egidi, F. Honsell, and S Ronchi. Operational, denotational and logical description: A case study. Fundamenta Informaticae, 16(2):149-170, 1992.
8. A. D. Ker, H. Nickau, and C. H. L. Ong. A universal innocent game model for the Böhm tree lambda theory. In Computer Science Logic: Proceedings of the 8th Annual Conference of the EACSL Madrid, Spain, volume 1683 of Lecture Notes in Computer Science, pages 405-419. Springer-Verlag, September 1999.
9. A. D. Ker, H. Nickau, and C. H. L. Ong. Innocent game models of untyped lambda calculus. To appear in Theoretical Computer Science, 2000.
10. J.J. Levy. An algebraic interpretation of A-calculus and a labelled A-calculus. In Lambda Calculus and Computer Science, volume 37 of LNCS, pages 147-165. Springer-Verlag, 1975.
11. G. Longo. Set-theoretical models of A-calculus: theories, expansions and isomorphisms. Annals of Pure and Applied Logic, 24:153-188, 1983.