Abstract
We study extensional models of the untyped lambda calculus in the setting of game semantics. In particular, we show that, somewhat unexpectedly and contrary to what happens in ordinary categories of domains, all reflexive objects in the category of games G, introduced by Abramsky, Jagadeesan and Malacaria, induce the same λ-theory. This is ℌ *, the maximal theory induced already by the classical CPO model D ∞, introduced by Scott in 1969. This results indicates that the current notion of game carries a very specific bias towards head reduction.
This work was partially supported by ESPRITWG 21900-TYPES, MURST-97 “Tecniche formali...” and TMR Network n. ERBFMRXCT980170-LINEAR
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. Domain theory in logical form. In Annals of Pure and Applied Logic, volume 51, pages 1–77, 1991.
S. Abramsky and R. Jagadeesan. Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic, 59(2):543–574, June 1994.
S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Ftp-available at http://www.dcs.ed.ac.uk/home/samson, 1994.
S. Abramsky and G. McCusker. Games for recursive types. In Theory and Formal Methods of Computing 1994. 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.
H. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam, 1984. revised edition.
C. Berline. From Computation to Foundations via Functions and Application: the λ-calculus and its Webbed Models. To appear.
M. Coppo, M. Dezani-Ciancaglini, F. Honsell, and G. Longo. Extended type structures and filter λ-models. In G. Lolli G. Longo and A. Marcja, editors, Logic Colloquium’ 82. Elsevier Science Publishers, 1984.
P. Di Gianantonio and G. Franco. A type assignment system for the game semantics. In ICTCS Proceedings, Prato, 1998. 115
J.Y. Girard. The system F of variable types, fifteen years later. Theoretical Computer Science, 45:159–192, 1986.
F. Honsell and M. Lenisa. Final semantics for untyped λ-calculus. In LNCS, volume 902, pages 249–265. Springer-Verlag, 1995.
F. Honsell and S. Ronchi Della Rocca. An Approximation Theorem for Topological Lambda Models and the Topological Incompleteness of Lambda Calculus. Journal of Computer and System Sciences, 45:49–75, 1992.
J.M.E. Hyland. A syntatic characterization of the equality in some models of the λ-calculus. Journal of London Mathematical Society, 122):361–370, 1976.
J.M.H. Hyland and C.H.L. Ong. On full abstraction for PCF:I, II, III. ftp-available at http://theory.doc.ic.ac.uk in directory papers/Ong.
G. A. McCusker. Games and full abstraction for a functional language with recursive types. PhD thesis, Imperial College, 1996.
D. Scott. Continuous lattices. In Toposes, Algebraic Geometry and Logic-Lecture Notes in Mathematics, volume 274. Springer-Verlag, Berlin, New York, 1972.
D. Scott and C. Gunter. Semantic domains. In Handbook of Theorical Computer Science. North Holland, 1990.
C. P. Wadsworth. The Relation between computational and Denotational Properties for Scott’s D ∞-models of the λ-calculus. SIAM, 5(3):488–521, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Gianantonio, P., Franco, G., Honsell, F. (1999). Game Semantics for Untyped λβη-Calculus. In: Girard, JY. (eds) Typed Lambda Calculi and Applications. TLCA 1999. Lecture Notes in Computer Science, vol 1581. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48959-2_10
Download citation
DOI: https://doi.org/10.1007/3-540-48959-2_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65763-7
Online ISBN: 978-3-540-48959-7
eBook Packages: Springer Book Archive