Sequentiality vs. concurrency in games and logic

Mathematical Structures in Computer Science

Volumn 13, Issue 4, 2003, Pages 531-565

  Abramsky, Samson ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 29144501287     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129503003980     Document Type: Article

References (66)

1. Abramsky, S. (1996) Retracing Some Paths in Process Algebra. In: Proceedings of CONCUR 96. Springer-Verlag Lecture Notes in Computer Science 1119 1–17.
2. Abramsky, S. (1997) Semantics of Interaction. In: Pitts, A. and Dybjer, P. (eds.) Semantics and Logics of Computation, Publications of the Newton Institute, Cambridge University Press 1–31.
3. Abramsky, S. (2000a) Process Realizability. In: Bauer, F.L. and Steinbriiggen, R. (eds.) Foundations of Secure Computation, IOS Press 167–180.
4. Abramsky, S. (2000b) Axioms for Definability and Full Completeness. In: Plotkin, G., Stirling, C. and Tofte, M. (eds.) Proof Language and Interaction: Essays in Honour of Robin Milner, MIT Press 55–75.
5. Abramsky, S., Hagverdi, E. and Scott, P. (2002) Geometry of Interaction and models of Linear Combinatory Logic. Mathematical Structures in Computer Science 12 625–664.
6. Abramsky, S. and Jagadeesan, R. (1994) New foundations for the geometry of interaction. Information and Computation 111 (1) 53–119. (Conference version appeared in LiCS ’92.)
7. Abramsky, S. and Jagadeesan, R. (1994b) Games and Full Completeness for Multiplicative Linear Logic. Journal of Symbolic Logic 59 (2) 543–574. (Conference version appeared in FSTTCS ’92.)
8. Abramsky, S. and Jung, A. (1994) Domain Theory. In: Abramsky, S., Gabbay, D. M. and Maibaum, T. S. E. (eds.) Handbook of Logic in Computer Science. Volume III: Semantic Structures, Oxford University Press 1–168.
9. Abramsky, S. and McCusker, G. (1999) Game Semantics. In: Berger, U. and Schwichtenberg, H. (eds.) Computational Logic, Springer-Verlag 1–56.
10. Abramsky, S. and Mellies, P.-A. (1998) Concurrent games and full completeness. Draft paper, 37 pages.
11. Abramsky, S. and Mellies, P.-A. (1999) Concurrent games and full completeness. Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science 431–44. Amadio, R. and Curien, R-L. (1998) Domains and Lambda-calculi, Cambridge University Press.
12. Andreoli, J.-M. and Pareschi, R. (1991) Linear objects: logical processes with built-in inheritance. New Generation Computing 9 (3–4) 445–473.
13. Baeten, J. C. M. and Weijland, W. P. (1990) Process Algebra, Cambridge University Press. Bainbridge, S., Freyd, P. J., Scedrov, A. and Scott, P. (1990) Functorial Polymorphism. Theoretical Computer Science 70 35–64.
14. Barbanera, F. and Berardi, S. (1996) A symmetric lambda calculus for classical program extraction. Information and Computation 125 103–117.
15. Blass, A. (1972) Degrees of indeterminacy of games. Fundamenta Mathematica 57: 151–162.
16. Blass, A. (1992) A game semantics for linear logic. Annals of Pure and Applied Logic 56 183–220.
17. Blass, A. (1993) Personal communication.
18. Blute, R. and Scott, P. J. (1996) Linear Lauchli Semantics. Annals of Pure and Applied Logic 77 101–142.
19. Curien, P.-L. (1986) Categorical combinators, sequential algorithms and functional programming, Pitman. (Revised edition, Birkhauser 1993.)
20. Danos, V., Joinet, J.-B. and Schellinx, H. (1996) A new deconstructive logic: Linear Logic. Journal of Symbolic Logic 62 (3).
21. Danos, Y. and Regnier, L. (1993) Local and Asynchronous beta-reduction (An analysis of Girard’s Execution Formula). In: Proc. of Eighth International Symposium on Logic in Computer Science, IEEE Press 296–306.
22. Danos, V. and Regnier, L. (1995) Proof-nets and the Hilbert space. In: Girard, J.-Y., Lafont, Y. and Regnier, L. (eds.) Advances in Linear Logic, London Mathematical Society Lecture Note Series 222, Cambridge University Press 307–328.
23. Devarajan, H., Hughes, D., Plotkin, G. and Pratt, Y. (1999) Full completeness of the multiplicative linear logic of Chu spaces. In: Proceedings of the Fourteenth International Symposium on Logic in Computer Science, IEEE Press 234–243.
24. Freyd, P. J. and Scedrov, A. (1991) Categories, Allegories, North-Holland Mathematical Library 39, Elsevier.
25. Girard, J.-Y. (1987) Linear Logic. Theoretical Computer Science 50 1–102.
26. Girard, J.-Y. (1988) Multiplicatives. Rendiconti del Seminario Matematico (Torino), Universita Pol. Torino.
27. Girard, J.-Y. (1989) Geometry of Interaction I: Interpretation of System F. In: Ferro. R. et al. (eds.) Logic Colloquium ’88, North-Holland 221–260.
28. Girard, J.-Y. (1990) Geometry of Interaction II: Deadlock-free Algorithms. In: Martin-Lof, P. and Mints, G. (eds.) COLOG-88. Springer-Verlag Lecture Notes in Computer Science 417 76–93.
29. Girard, J.-Y. (1991) A new constructive logic: classical logic. Mathematical Structures in Computer Science 1 255–296.
30. Girard, J.-Y. (1995) Geometry of Interaction III: Accommodating the Additives. In: Girard, J.-Y., Lafont, Y. and Regnier, L. (eds.) Advances in Linear Logic, London Math. Soc. Lecture Note Series 222, Cambridge University Press 1–42.
31. Girard, J.-Y. (1995) Proof-nets: the parallel syntax for proof theory. In: Logic and Algebra, Marcel Dekker.
32. Girard, J.-Y. (1998) Light Linear Logic. Information and Computation 143 175–204.
33. Girard, J.-Y. (2001) Locus Solum. Mathematical Structures in Computer Science 11 (3) 301–506.
34. Girard, J.-Y., Lafont, Y. and Taylor, P. (1989) Proofs and Types, Cambridge University Press.
35. Haghverdi, E. (2000) A Categorical Approach to Linear Logic, Geometry of Proofs and Full Completeness, Ph.D. thesis, University of Ottawa.
36. Hintikka, J. and Sandu, G. (1995) What is the logic of parallel processing? International Journal of the Foundations of Computer Science 6 27–49.
37. Hoare, C. A. R. (1985) Communicating Sequential Processes, Prentice-Hall International.
38. Hyland, M. and Ong, C.-H.L. (1992) Fair Games and Full Completeness for Multiplicative Linear Logic without the MIX rule. (Unpublished manuscript.)
39. Hyland, M., Robinson, E. P. and Rosolini, G. (1989) Algebraic types in PER models. In: Proceedings of the Fifth Conference on Mathematical Foundations of Programming Semantics. Springer-Verlag Lecture Notes in Computer Science 442 333–350.
40. Jagadeesan, R., Panangaden, P. and Pingali, K. (1989) A fully abstract semantics for a functional language with logic variables. In: Proceedings of the 4th International Symposium on Logic in Computer Science.
41. Kahn, G. and Plotkin, G. (1993) Concrete Domains. Theoretical Computer Science 121 187–277. (Appeared as TR IRIA-Laboria 336 in 1978.)
42. Laird, J. D. (1999) A semantic analysis of control, Ph.D. thesis, University of Edinburgh.
43. Laird, J. D. (2001) A deconstruction of non-deterministic classical cut-elimination. In the Proceedings of TLCA.
44. Lamarche, F. (1995) Games semantics for Full Propositional Linear Logic. In: Proceedings of the Tenth International Symposium on Linear Logic.
45. Laurent, O. (2001) Polarized games for classical logic. (Unpublished - available at http://www.pps. jussieu.fr/ laurent/)
46. Laurent, O., Quatrini, M. and Tortora de Falco, L. (2000) Polarized and Focalized Linear and Classical Proofs. To appear in Annals of Pure and Applied Logic.
47. Loader, R. (1994a) Linear Logic, Totality and Full Completeness. In: Proceedings of the Ninth International Symposium on Logic in Computer Science, IEEE Press.
48. Loader, R. (1994b) Models of lambda calculi and linear logic: structural, equational and proof-theoretic characterisations, Ph.D. thesis, Oxford University.
49. Loader, R. (1996) Finitary PCF is not decidable. To appear in Theoretical Computer Science.
50. Longley, J. (1998) The sequentially realizable functionals. Technical report ECS-LFCS-98-402, University of Edinburgh. To appear in Annals of Pure and Applied Logic.
51. Milner, R. (1975) Processes: a mathematical model of computing agents. Logic Colloquium, Bristol 1973, North-Holland 157–174.
52. Milner, R. (1989) Communication and Concurrency, Prentice-Hall International.
53. Milner, R. (1999) Communicating and Mobile Systems: the Pi-Calculus, Cambridge University Press.
54. Murawski, A. S. and Ong, C.-H.L. (1999) Exhausting strategies, joker games, and full completeness for IMLL with Unit. In: Proceedings of the 8th Conference on Category Theory and Computer Science. Electronic Notes in Theoretical Computer Science 29.
55. Murawski, A. S. and Ong, C.-H.L. (2000) Discreet games, Light Affine Logic, and PTIME computation. In: Proceedings of CSL2000: Annual Conference of the European Association of Computer Science Logic. Springer-Verlag Lecture Notes in Computer Science 1862 427–441.
56. Nielsen, M., Plotkin, G. and Winskel, G. (1981) Petri nets, event structures and domains, Part 1. Theoretical Computer Science 13 85–108.
57. Ong, C.-H.L. (1996) A semantic view of classical proofs: type-theoretical, categorical and denotational characterizations. In: Proceedings of the Eleventh International Symposium on Logic in Computer Science, IEEE Press 230–241.
58. Parigot, M. (1992) ily calculus: an algorithmic interpretation of classical natural deduction. In: Proc. International Conference on Logic Programming and Automated Reasoning, Springer-Verlag 190–201.
59. Petri, C. A. (1977) Non-sequential processes. Technical report ISF-77-05, GMD-ISF. Plotkin, G. D. (1977) LCF considered as a programming language. Theoretical Computer Science 5 223–255.
60. Plotkin, G.D. (1980) Lambda definability in the full type hierarchy. In: To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press 363–373.
61. Saraswat, V. (1993) Concurrent Constraint Programming, MIT Press.
62. Saraswat, V., Rinard, M. and Panangaden, P. (1991) Semantic foundations of concurrent constraint programming. In: Proceedings of 18th ACM Symposium on Principles of Programming Languages.
63. Tan, A. (1997) Full completeness for models of linear logic, Ph.D. thesis, University of Cambridge.
64. Urban C. (2000) Classical Logic and Computation, Ph.D. thesis, Cambridge University.
65. Vuillemin J. (1973) Proof Techniques for Recursive programs, Ph.D. thesis, Stanford University.
66. Winskel, G. and Nielsen, M. (1995) Models for Concurrency. In: Abramsky, S., Gabbay, D. M. and Maibaum, T. S. E. (eds.) Handbook of Logic in Computer Science Vol. 4, Oxford University Press 1–148.