An Algebraic Account of References in Game Semantics

Electronic Notes in Theoretical Computer Science

Volumn 249, Issue , 2009, Pages 377-405

  Melliès, Paul André ^a   Tabareau, Nicolas ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

compact closed categories; game semantics; general references; memory access; replication modality; tensor logic; trace operator

Indexed keywords

COMPACT-CLOSED CATEGORIES; GAME SEMANTICS; GENERAL REFERENCES; MEMORY ACCESS; REPLICATION MODALITY; TRACE OPERATOR;

ALGEBRA; CELL MEMBRANES; LINGUISTICS; SEMANTICS; SEMICONDUCTOR STORAGE; TENSORS;

GAME THEORY;

EID: 68549132392     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2009.07.099     Document Type: Article

References (27)

1. Abramsky S. Axioms for Definability and Full Completeness (1999), MIT Press
2. Abramsky S., Honda K., and McCusker G. A fully abstract game semantics for general reference. 13th IEEE Symposium on Logic in Computer Science (1998), IEEE Computer Society Press
3. Abramsky S., and Lenisa M. Axiomatizing Fully Complete Models for ML Polymorphic Types. Proceedings of the International Symposium on Mathematical Foundations of Computer Science. Springer Lecture Notes in Computer Science volume 1893 (2000)
4. S. Abramsky and G. McCusker. Linearity, sharing and state: a fully abstract game semantics for idealized algol with active expressions, 1997
5. Abramsky S., and McCusker G. Call-by-value games. In: Nielsen M., and Thomas W. (Eds). 6th Annual Conference of the European Association for Computer Science Logic. Lecture Notes in Computer Science volume 1414 (1998), Springer
6. Benton N. A mixed linear and non-linear logic: Proofs, terms and models. 3th Annual Conference of the European Association for Computer Science Logic. Poland. LNCS volume 933 (June 1995), Springer-Verlag
7. Berry G., and Curien P.-L. Sequential algorithms on concrete data structures. Theoretical Computer Science 20 (1982) 265-321
8. Russ Harmer. Games and Full Abstraction for Nondeterministic Languages. PhD thesis, University of London, 2000
9. Masahito Hasegawa. On traced monoidal closed categories. Mathematical Structures in Computer Science, 2008. Published online on 27 October 2008
10. Hyland M., and Ong L. On full abstraction for PCF: I, II and III. Information and Computation 163 2 (December 2000) 285-408
11. Joyal A. Remarques sur la théorie des jeux à deux personnes. Gazette des Sciences Mathématiques du Québec 1 4 (1977) 46-52 English version by Robin Houston
12. Joyal A., Street R., and Verity D. Traced monoidal categories. Mathematical Proceedings of the Cambridge Philosophical Society 119 447-468 (1996) 184
13. Kelly M., and Laplaza M. Coherence for compact closed categories. Journal of Pure and Applied Algebra 19 (1980) 193-213
14. J. Laird. A categorical semantics of higher order store. In Proceedings, 9th Conference on Category Theory and Computer Science, 2002
15. Laird J. A game semantics of names and pointers. Annals of Pure and Applied Logic (2009)
16. Levy P.B. Global state considered helpful. Proceedings of Mathematical Foundations of Programming Semantics. (MFPS 2008). Electronic Notes in Computer Science 218 (2008) 241-259
17. May P. Duality in bicategories and topological applications. A brief memorial talk for Saunders MacLane (april 2006). http://www.math.uchicago.edu/~may/
18. McCusker G. On the semantics of Idealized Algol without the bad variable constructor. Proceedings of Mathematical Foundations of Programming Semantics. (MFPS 2003). Electronic Notes in Computer Science 83 (2003)
19. Paul-André Melliès and Nicolas Tabareau. Resource modalities in game semantics. In 22th IEEE Symposium on Logic in Computer Science, pages 389-398, 2007
20. Robin Milner. Action Calculi V: reflexive molecular forms. Unpublished, third draf, June 1994
21. A.S. Murawski. Bad Variables Under Control. In 21th Annual Conference of the European Association for Computer Science Logic, 2007
22. C.-H. L. Ong and S. Sanjabi. Fully abstract semantics of additive aspects by translation. In Proceedings of Sixth International Conference on Aspect-Oriented Software Development (AOSD 2007), 2007
23. Paul-André Melliès and Nicolas Tabareau and Christine Tasson. An explicit formula for the free exponential modality of linear logic. In 36th International Colloquium on Automata, Languages and Programming (ICALP), 2009
24. Reddy U. Global state considered unnecessary: An introduction to object-based semantics. Journal of Lisp and Symbolic Computation 9 (1996) 7-76
25. John Reynolds. Syntactic control of interference. 5th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 39-46, 1978
26. Nicolas Tabareau. Modalités de ressources et contrôle en logique tensorielle. PhD thesis, Université Paris Diderot, 2008
27. N. Tzevelekos. Full abstraction for nominal general references. In 22th IEEE Symposium on Logic in Computer Science, pages 399-410, 2007