Algorithmic games for full ground references

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

Volumn 7392 LNCS, Issue PART 2, 2012, Pages 312-324

  Murawski, Andrzej S ^a   Tzevelekos, Nikos ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; SEMANTICS;

CONTEXTUAL EQUIVALENCE; EMPTINESS PROBLEM; GAME SEMANTICS; ML-LIKE LANGUAGES; PUSH-DOWN AUTOMATA; TECHNICAL LEVELS;

ROBOTS;

EID: 84874144182     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31585-5_30     Document Type: Conference Paper

References (22)

1. Abramsky, S., Ghica, D., Murawski, A.S., Ong, C.-H.L., Stark, I.: Nominal games and full abstraction for the nu-calculus. In: LICS, pp. 150-159 (2004)
2. Abramsky, S., McCusker, G.: Call-by-Value Games. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol. 1414, pp. 1-17. Springer, Heidelberg (1998)
3. Ahmed, A., Dreyer, D., Rossberg, A.: State-dependent representation independence. In: POPL, pp. 340-353 (2009)
4. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC, pp. 202-211 (2004)
5. Benton, N., Leperchey, B.: Relational Reasoning in a Nominal Semantics for Storage. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol. 3461, pp. 86-101. Springer, Heidelberg (2005)
6. Cheng, E.Y.C.,Kaminski, M.: Context-free languages over infinite alphabets. Acta Inf. 35(3), 245-267 (1998)
7. Dreyer, D., Neis, G., Birkedal, L.: The impact of higher-order state and control effects on local relational reasoning. In: ICFP, pp. 143-156 (2010)
8. Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Asp. Comput. 13, 341-363 (2002)
9. Honda, K., Yoshida, N.: Game-theoretic analysis of call-by-value computation. TCS 221(1-2), 393-456 (1999)
10. Hopkins, D., Murawski, A.S., Ong, C.-H.L.: A Fragment of ML Decidable by Visibly Pushdown Automata. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 149-161. Springer, Heidelberg (2011)
11. Jeffrey, A., Rathke, J.: Towards a theory of bisimulation for local names. In: LICS (1999)
12. Kozen, D.: Automata and Computability. Springer (1997)
13. Koutavas, V., Wand, M.: Small bisimulations for reasoning about higher-order imperative programs. In: POPL, pp. 141-152 (2006)
14. Laird, J.: A game semantics of names and pointers. APAL 151, 151-169 (2008)
15. Murawski, A.S.: Functions with local state: regularity and undecidability. TCS 338 (2005)
16. Murawski, A.S., Tzevelekos, N.: Full Abstraction for Reduced ML. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 32-47. Springer, Heidelberg (2009)
17. Murawski, A.S., Tzevelekos, N.: Algorithmic Nominal Game Semantics. In: Barthe, G. (ed.) ESOP 2011. LNCS, vol. 6602, pp. 419-438. Springer, Heidelberg (2011)
18. Murawski, A.S., Tzevelekos, N.: Game semantics for good general references. In: LICS (2011)
19. Pitts, A.M., Stark, I.D.B.: Operational reasoning for functions with local state. In: Gordon, Pitts (eds.) Higher-Order Operational Techniques in Semantics, pp. 227-273. CUP (1998)
20. Reddy, U.S., Yang, H.: Correctness of data representations involving heap data structures. Sci. Comput. Program. 50(1-3), 129-160 (2004)
21. Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higher-order languages. ACM Trans. Program. Lang. Syst. 33(1), 5:1-5:69 (2011)
22. Tzevelekos, N.: Full abstraction for nominal general references. LMCS 5,38 (2009)