Advertisement

Game Semantics for the Pure Lazy λ-Calculus

  • Pietro Di Gianantonio
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2044)

Abstract

In this paper we present a fully abstract game model for the pure lazy λ-calculus, i.e. the lazy λ-calculus without constants. In order to obtain this result we introduce a new category of games, the monotonic games, whose main characteristic consists in having an order relation on moves.

Keywords

Operational Semantic Game Model Nest Level Lambda Calculus Monotone Strategy 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. AJM94.
    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.Google Scholar
  2. AM95a.
    S. Abramsky and G. McCusker. Games and full abstraction for the lazy λ-calculus. In Proceedings LICS’ 95, 1995.Google Scholar
  3. AM95b.
    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.Google Scholar
  4. AO93.
    S. Abramsky and C.H.L. Ong. Full abstraction in the lazy λ-calculus. Information and Computation, 105:159–267, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  5. BPR98.
    O. Bastonero, A. Pravato, and S Ronchi. Structures for lazy semantics. In Programming Concepts and Methods, PROCOMET’98. Chapman & Hall, 1998.Google Scholar
  6. DGF00.
    P. Di Gianantonio and G. Franco. The fine structure of game lambdamodels. In Conference on the Foundation of Software Technology and Theoretical Computer Science (FSTTS’ 00), volume 1974 of LNCS, pages 429–441. Springer-Verlag, 2000.Google Scholar
  7. EHR92.
    L. Egidi, F. Honsell, and S Ronchi. Operational, denotational and logical description: A case study. Fundamenta Informaticae, 16(2):149–170, 1992.zbMATHMathSciNetGoogle Scholar
  8. KNO99.
    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.Google Scholar
  9. KNO00.
    A. D. Ker, H. Nickau, and C. H. L. Ong. Innocent game models of untyped lambda calculus. To appear in Theoretical Computer Science, 2000.Google Scholar
  10. L75.
    J.J. Lévy. An algebraic interpretation of λ-calculus and a labelled λ-calculus. In Lambda Calculus and Computer Science, volume 37 of LNCS, pages 147–165. Springer-Verlag, 1975.CrossRefGoogle Scholar
  11. Lon83.
    G. Longo. Set-theoretical models of λ-calculus: theories, expansions and isomorphisms. Annals of Pure and Applied Logic, 24:153–188, 1983.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Pietro Di Gianantonio
    • 1
  1. 1.Dipartimento di Matematica e InformaticaUniversità di UdineUdineItaly

Personalised recommendations