A game semantics of local names and good variables

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

Volumn 2987, Issue , 2004, Pages 289-303

  Laird, James ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY;

AUTOMORPHISM GROUPS; DIALOGUE GAME; FULL ABSTRACTION; GAME SEMANTICS; GARBAGE COLLECTION; GOOD VARIABLES; NATURAL NUMBER;

SEMANTICS;

EID: 35048848009     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24727-2_21     Document Type: Article

References (24)

1. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148(1):1-70, 1999.
2. . S. Abramsky and G. McCusker. Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions. In P.W. O'Hearn and R. Tennent, editors, Algol-like languages. Birkhauser, 1997.
3. S. Abramsky and G. McCusker. Call-by-value games. In M. Neilsen and W. Thomas, editors, Proceedings of CSL '97, pages 1-17. Springer-Verlag, 1998.
4. S. Abramsky, K. Honda, G. McCusker. A fully abstract games semantics for general references. In Proceedings of the 13th Annual Symposium on Logic In Computer Science, LICS '98, 1998.
5. S. Abramsky, R. Jagadeesan and P. Malacaria. Full abstraction for PCF. Information and Computation, 163:409-470, 2000.
6. D. Ghica and G. McCusker. The regular language semantics of second-order Idealised Algol. Theoretical Computer Science, 2003. To appear.
7. K. Honda and N. Yoshida. Game theoretic analysis of call-by-value computation. In Proceedings of ICALP '97, volume 1256 of Lecture Notes in Computer Science. Springer-Verlag, 1997.
8. J. M. E. Hyland and C.-H. L. Ong. On full abstraction for PCF: I, II and III. Information and Computation, 163:285-408, 2000.
9. Alan Jeffrey and Julian Rathke. Towards a theory of bisimulation for local names. In Proceedings of LICS '99. IEEE Press, 1999.
10. J. Laird. A Semantic Analysis of Control. PhD thesis, Department of Computer Science, University of Edinburgh, 1998.
11. J. Laird. A fully abstract game semantics of local exceptions. In Proceedings of LICS '01. IEEE Computer Society Press, 2001.
12. J. Laird. A game semantics of ICSP. In Proceedings of MFPS XVII, number 45 in Electronic notes in Theoretical Computer Science. Elsevier, 2001.
13. O. Laurent. Polarized games. In Proceedings of the Seventeenth International Symposium on Logic In Computer Science, LICS '02, 2002.
14. P. Malacaria and C. Hankin. Non-deterministic games and program analysis: An application to security. In Proceedings of LICS '99, 1999.
15. G. McCusker. Games and full abstraction for a functional metalanguage with recursive types. PhD thesis, Imperial College London, 1996. Published by Cambridge University Press.
16. G. McCusker. On the semantics of the bad-variable constructor in Algol-like languages. In Proceedings of MFPS XIX, ENTCS, 2003. To appear.
17. A. Murawski. On program equivalence in languages with ground-type references. In Proceedings of LICS '03. IEEE Press, 2003.
18. H. Nickau. Hereditarily sequential functionals. In Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at St. Petersburg, LNCS. SpringerVerlag, 1994.
19. C.H.-L. Ong. Observational equivalence of 3rd-order Idealized Algol is decidable. In Proceedings of LICS'02. IEEE Press, 2002.
20. A. Pitts and I. Stark. Observable features of higher-order functions that dynamically create local names. In Proceedings of MFCS '93, pages 122 -141, 1993.
21. J. Power and H. Thielecke. Environments in Freyd categories and Κ-categories. In Proceedings of ICALP '99, number 1644 in LNCS. Springer, 1999.
22. I. Stark. Names and higher-order functions. Technical Report 363, University of Cambridge Computer Laboratory, 1995.
23. I. Stark. Categorical models for local names. Lisp and Symbolic Computation, 1(9):122-141, 1996.
24. E. Sumii and B.C. Pierce. Logical relations for encryption. Journal of Computer Security, 2002. To appear.