Abstract games for linear logic extended abstract

Electronic Notes in Theoretical Computer Science

Volumn 29, Issue , 1999, Pages 127-150

  Hyland, Martin ^a   Schalk, Andrea ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT GAMES; COMPUTATIONAL CONTENTS; GAME TREES; LINEAR LOGIC;

COMPUTER GRAPHICS; COMPUTER PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; SEMANTICS; TREES (MATHEMATICS);

FORMAL LOGIC;

EID: 0005447793     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80312-3     Document Type: Conference Paper

References (41)

1. Abramsky S. Semantics of interaction: an introduction to game semantics. Pitts A.M., Dybjer P. Semantics and Logics of Computation. 1997;1-31 CUP
2. S. Abramsky and R. Jagadeesan. New foundations for the geometry of interaction. In Proceedings, Seventh Annual IEEE Symposium on Logic in Computer Science 1992, pages 211-222. IEEE Computer Science Press, Silver Spring, MD., 1992.
3. Abramsky S., Jagadeesan R. Games and full completeness for multiplicative linear logic. J. Symbolic Logic. 59:1994;543-574
4. Abramsky S., Jagadeesan R. New foundations for the geometry of interaction. Inf. and Comp. 111:(1):1994;53-120
5. S. Abramsky, R. Jagadeesan, and P. Malacaria. Games and full abstraction for PCF. Information and Computation. To appear.
6. Abramsky S., Jagadeesan R., Malacaria P. Full abstraction for PCF (extended abstract). Theoretical Aspects of Computer Software: TAGS '94, Sendai, Japan, volume 789 of LNCS. 1994;1-15
7. S. Abramsky and G. McCusker. Games and full abstraction for the lazy λ-calculus. In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 234-243. IEEE Computer Society Press, 1995.
8. Abramsky S., McCusker G. Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions. O'Hearn P.W., Tennent R.D. Algol-like languages. 1997;Birkhauser
9. P. Baillot, V. Danos, T. Ehrhard, and L. Regnier. Believe it or not, AJM's games model is a model of classical linear logic. In Proceedings of the Twelfth Annual Symposium on Logic in Computer Science 1997, pages 68-75. IEEE Computer Society Press, 1997.
10. P. Baillot, V. Danos, T. Ehrhard, and L. Regnier. Timeless games. In Proceedings of the tenth Workshop on Computer Science Logic, volume 1414 of LNCS. Springer Verlag, 1998.
11. M. Barr. *-Autonomous categories. Number 752 in Lecture Notes in Mathematics. Springer-Verlag 1979.
12. Barr M. *-Autonomous categories and linear logic. Mathematical Structures in Computer Science. 1:(2):July 1991;159-178
13. Beck J.M. Triples, Algebras, and Cohomology. PhD thesis, Columbia University. 1967
14. N. Benton, G. Bierman, V. de Paiva, and M. Hyland. Linear lambda-calculus and categorical models revisited. In Proceedings of the Sixth Workshop on Computer Science Logic, volume 702 of LNCS, pages 61-84. Springer Verlag, 1993.
15. N. Benton, G. Bierman, V. de Paiva, and M. Hyland. A term calculus for intuitionistic linear logic. In M. Bezem and J.F. Groote, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, TLCA'93, Utrecht, The Netherlands, 16-18 March 1993, volume 664 of LNCS, pages 75-90. Springer Verlag, 1993.
16. Bierman G.M. On intuitionistic linear logic. Technical Report 346, University of Cambridge Computer Laboratory. August 1994
17. G. M. Bierman. What is a categorical model of intuitionistic linear logic? In Proceedings of the Second International Conference on Typed Lambda Calculus, volume 902 of LNCS, pages 73-93, 1995.
18. Blass A. A game semantics for linear logic. Annals of Pure and Applied Logic. 56:1992;183-220
19. Blass A. Questions and answers - a category arising in linear logic, complexity theory and set theory. Girard J.Y., Lafont Y., Regnier L. Advances in Linear Logic. 1995;61-81 CUP
20. P.-H. Chu. *-Autonomous categories, chapter Constructing *-autonomous categories. In Lecture Notes in Mathematics [11], 1979. (Appendix).
21. Curien P.-L. Categorical Combinators, Sequential Algorithms and Functional Programming. Birkhäuser, 2nd edn. edition. 1993
22. de Paiva V.C.V. A dialectica-like model of linear logic. Pitt D.H., Rydeheard D.E., Dybjer P., Pitts A.M., Poigné A. Category Theory and Computer Science, volume 389 of Lecture Notes in Computer Science. 1989;341-356 Springer
23. J.-Y. Girard. Geometry of interaction 3: Accommodating the additives, ftp from ftp://iml.univ-mrs.fr/pub/girard/as GOI3.ps.gz.
24. Girard J.-Y. Linear logic. Theoretical Computer Science. 50:1987;1-102
25. Girard J.-Y. Geometry of interaction 2: Deadlock-free algorithms. Martin-Löf P., Mints G. International Conference on Computer Logic, COLOG88, volume 417 of LNCS. 1988;76-93 Springer Verlag
26. Girard J.-Y. Geometry of interaction 1: Interpretation of System F. Ferro R., et al. Logic Colloquium 88. 1989;North Holland
27. Girard J.-Y. Towards a geometry of interaction. Gray J.W., Scedrov A. Categories in Computer Science and Logic, volume 92 of Contemporary Mathematics. 1989;69-108 AMS
28. J.-Y. Girard. Linear logic: its syntax and semantics. In J.-Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in linear logic. London Mathematical Society Lecture Note Series, Cambridge University Press, 1995. Available by anonymous ftp from lmd.univ-mrs.fr as /pub/girard/Synsem.ps.Z.
29. J.M.E. Hyland and C.-H.L. Ong. On Full Abstraction for PCF: I, II and III. Information and Computation. To appear.
30. Hyland J.M.E., Ong C.-H.L. Fair games and full completeness for multiplicative linear logic without the mix-rule, ftp from ftp.comlab.ox.ac.uk as fcomplete.ps.gz in /pub/Documents/techpapers/Luke.Ong. 1993
31. Hyland M. Game semantics. Pitts A.M., Dybjer P. Semantics and Logics of Computation. 1997;131-194 CUP
32. Kahn G., Plotkin G.D. Concrete domains. Theoretical Computer Science. 121:1993;1-2. 187-277
33. Y. Lafont and T. Streicher. Games semantics for linear logic. In Proc. Logic in Computer Science 1991. IEEE Computer Science Press, Silver Spring, MD., 1991.
34. Laird J.G. Full abstraction for functional languages with control. Proc. Logic in Computer Science 1997. 1997;58-64 IEEE Computer Science Press, Silver Spring, MD
35. Loader R. Linear logic, totality, and full completeness. Proc. Logic in Computer Science 1994. 1994;Silver Spring, MD
36. Loader R. Models of lambda calculi and linear logic: Structural, equational and proof-theoretic characterisations. PhD thesis, St. Hugh's College, Oxford, Michaelmas. 1994
37. G. McCusker. Games and full abstraction for FPC. In Proceedings, Eleventh Annual IEEE Symposium on Logic in Computer Science, pages 174-183. IEEE Computer Society Press, 1996.
38. H. Nickau. Hereditarily sequential functionals. In Proceedings of the Symposium of Logical Foundations of Computer Science, volume 813 of LNCS, pages 253-264. Springer Verlag, 1994.
39. Street R. The formal theory of monads. Journal of Pure and Applied Algebra. 2:1972;149-168
40. Tan A.M. Full completeness for models of linear logic. PhD thesis, University of Cambridge. 1997
41. Winskel G. Event structures. Petri Nets: Applications and Relationships to Other Models of Concurrency, Advances in Petri Nets 1986, volume 255 of LNCS. 1986;325-392 Springer Verlag