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.
Research partially supported by Esprit Working Group TYPES and TMR Network LINEAR
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
S. Abramsky and G. McCusker. Games and full abstraction for the lazy λ-calculus. In Proceedings LICS’ 95, 1995.
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.
S. Abramsky and C.H.L. Ong. Full abstraction in the lazy λ-calculus. Information and Computation, 105:159–267, 1993.
O. Bastonero, A. Pravato, and S Ronchi. Structures for lazy semantics. In Programming Concepts and Methods, PROCOMET’98. Chapman & Hall, 1998.
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.
L. Egidi, F. Honsell, and S Ronchi. Operational, denotational and logical description: A case study. Fundamenta Informaticae, 16(2):149–170, 1992.
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.
A. D. Ker, H. Nickau, and C. H. L. Ong. Innocent game models of untyped lambda calculus. To appear in Theoretical Computer Science, 2000.
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.
G. Longo. Set-theoretical models of λ-calculus: theories, expansions and isomorphisms. Annals of Pure and Applied Logic, 24:153–188, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Gianantonio, P. (2001). Game Semantics for the Pure Lazy λ-Calculus. In: Abramsky, S. (eds) Typed Lambda Calculi and Applications. TLCA 2001. Lecture Notes in Computer Science, vol 2044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45413-6_12
Download citation
DOI: https://doi.org/10.1007/3-540-45413-6_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41960-0
Online ISBN: 978-3-540-45413-7
eBook Packages: Springer Book Archive