Full abstraction for nominal general references

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2007, Pages 399-408

  Tzevelekos, Nikos ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT SEMANTICS; COMPUTATIONAL EFFECTS; FULL ABSTRACTION; FUNCTIONAL LANGUAGES; GAME SEMANTICS; HIGHER ORDER; NOMINAL SETS; ONE STEP;

ABSTRACTING; SEMANTICS;

COMPUTATION THEORY;

EID: 54049096267     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2007.21     Document Type: Conference Paper

References (15)

1. S. Abramsky. Axioms for definability and full completeness. In Proof, Language, and Interaction: essays in honour of Robin Milner, pages 55-75. MIT Press, 2000.
2. S. Abramsky, D. Ghica, A. Murawski, L. Ong, and I. Stark. Nominal games and full abstraction for the nu-calculus. In Proceedings of LICS '04, 2004.
3. S. Abramsky, K. Honda, and G. McCusker. A fully abstract game semantics for general references. In LICS '98, 1998.
4. S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Information and Computation, 163(2), 2000.
5. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2002. (Pubitemid 41204157)
6. K. Honda and N. Yoshida. Game-theoretic analysis of call-by-value computation. TCS, 221(1-2):393-456, 1999. (Pubitemid 129608973)
7. J. M. E. Hyland and C.-H. L. Ong. On full abstraction for PCF: I, II, III. Information and Computation, 163(2), 2000.
8. J. Laird. A game semantics of names and pointers. Submitted.
9. J. Laird. A categorical semantics of higher order store. ENTCS, 69, 2002.
10. G. McCusker. Games and Full Abstraction for a Functional Metalanguage with Recursive Types. Distinguished Dissertations. Springer-Verlag, London, 1998.
11. E. Moggi. Computational lambda-calculus and monads. In Proceedings of LICS'89, 1989.
12. L. Ong. Observational equivalence of third-order idealized algol is decidable. In Proceedings of LICS '02, 2002.
13. A. M. Pitts. Nominal logic, a first order theory of names and binding. Information and Computation, 186:165-193, 2003.
14. A. M. Pitts and I. D. B. Stark. Observable properties of higher order functions that dynamically create local names, or: What's new? In Proc. 18th MFCS, 1993. LNCS 711.
15. I. Stark. Names and Higher-Order Functions. PhD thesis, University of Cambridge, Dec. 1994.