Game semantics for untyped λβηcalculus

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

Volumn 1581, Issue , 1999, Pages 114-128

  Gianantonio, Pietro Di ^a   Franco, Gianluca ^a   Honsell, Furio ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; DIFFERENTIATION (CALCULUS); PATHOLOGY;

GAME SEMANTICS; UNTYPED LAMBDA CALCULUS;

SEMANTICS;

EID: 84949229369     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (18)

1. S. Abramsky. Domain theory in logical form. In Annals of Pure and Applied Logic, volume 51, pages 1-77, 1991.
2. S. Abramsky and R. Jagadeesan. Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic, 59 (2):543-574, June 1994.
3. S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Ftp-available at http://www.dcs.ed.ac.uk/home/samson, 1994.
4. S. Abramsky and G. McCusker. Games for recursive types. In Theory and Formal Methods of Computing 199f. Imperial College Press, October 1995.
5. S. Abramsky and C.H.L. Ong. Full abstraction in the lazy λ-calculus. Information and Computation, 105:159-267, 1993.
6. H. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam, 1984. revised edition.
7. C. Berline. From Computation to Foundations via Functions and Application: the λ-calculus and its Webbed Models. To appear.
8. 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.
9. P. Di Gianantonio and G. Franco. A type assignment system for the game semantics. In ICTCS Proceedings, Prato, 1998.
10. J.Y. Girard. The system F of variable types, fifteen years later. Theoretical Computer Science, 45:159-192, 1986.
11. F. Honsell and M. Lenisa. Final semantics for untyped λ-calculus. In LNCS, volume 902, pages 249-265. Springer-Verlag, 1995.
12. 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.
13. J.M.E. Hyland. A syntatic characterization of the equality in some models of the λ-calculus. Journal of London Mathematical Society, 12 (2):361-370, 1976.
14. J.M.H. Hyland and C.H.L. Ong. On full abstraction for PCF:I, II, III. ftp-available at theory.doc.ic.ac.ukindirectorypapers/Ong.
15. G. A. McCusker. Games and full abstraction for a functional language with recursive types. PhD thesis, Imperial College, 1996.
16. D. Scott. Continuous lattices. In Toposes, Algebraic Geometry and Logic - Lecture Notes in Mathematics, volume 274. Springer-Verlag, Berlin, New York, 1972.
17. D. Scott and C. Gunter. Semantic domains. In Handbook of Theorical Computer Science. North Holland, 1990.
18. ∞-models of the λ-calculus. SIAM, 5 (3):488-521, 1976.