The fine structure of game lambda models

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

Volumn 1974, Issue , 2000, Pages 429-441

  Di Gianantonio, Pietro ^a   Franco, Gianluca ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIATION (CALCULUS); FORESTRY; SEMANTICS; SOFTWARE ENGINEERING;

FINE STRUCTURES; GAME SEMANTICS; UNTYPED LAMBDA CALCULUS;

CALCULATIONS;

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

References (17)

1. S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Accepted for pubblication, Information and Computation, 1996.
2. S. Abramsky and G. McCusker. Games and Full Abstraction for the Lazy Lambda-Calculus. In D. Kozen, editor, Proceedings of the Tenth Annual Symposium on Logic in Computer Science, pages 234–243. IEEE Computer Society Press, June 1995.
3. H. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1984. Revised edition.
4. C. Berline. From Computation to Foundations via Functions and Application: the λ-calculus and its Webbed Models. To appear in Theoretical Computer Science.
5. P. Di Gianantonio and G. Franco. The Fine Structure of Game Lambda Models. Technical report, Department of Mathematics and Computer Science, University of Udine, 2000 Electronically available: http://www.dimi.uniud.it/~pietro/Papers.
6. P. Di Gianantonio, G. Franco, and F. Honsell. Game semantics for the untyped λβη-calculus. In Proceedings of the International Conference on Typed Lambda Calculi and Applications 1999, volume 1591 of Lecture Notes in Computer Science, pages 114–128. Springer-Verlag, 1999.
7. F. Honsell and M. Lenisa. Final semantics for untyped λ-calculus. In M. Dezani, editor, Proceedings of the International Conference on Typed Lambda Calculi and Applications 1995, volume 902 of Lecture Notes in Computer Science, pages 249–265. Springer-Verlag, 1995.
8. J. M. E. Hyland and C. H. L. Ong. On full abstraction for PCF:I. Models, observables and the full abstraction problem, II. Dialogue games and innocent strategies, III. A fully abstract and universal game model. To appear in Information and Computation, 2000.
9. 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.
10. 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.
11. A. D. Ker, H. Nickau, and C. H. L. Ong. A universal innocent game model for the B¨ohm 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.
12. A. D. Ker, H. Nickau, and C. H. L. Ong. Innocent game models of untyped lambda calculus. To appear in Theoretical Computer Science, 2000.
13. J.J. Lévy. An algebraic interpretation of λ-calculus and a labelled λ-calculus. In C. Böhm, editor, Lambda Calculus and Computer Science, volume 37 of Lecture Notes in Computer Science, pages 147–165. Springer-Verlag, 1975.
14. G. Longo. Set-theoretical models of λ-calculus: theories, expansions and isomorphisms. Annals of Pure and Applied Logic, 24:153–188, 1983.
15. H. Nickau. Hereditarily sequential functionals. In Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at St. Petersburg, Lecture Notes in Computer Science. Springer-Verlag, 1994.
16. D. Scott. Continuous lattices. In Toposes, Algebraic Geometry and Logic, volume 274 of Lecture Notes in Mathematics. Springer-Verlag, 1972.
17. C. P. Wadsworth. Approximate Reduction and Lambda Calculus Models. SIAM Journal of Computing, 7(3):337–356, August 1978.