Algorithmic nominal game semantics

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

Volumn 6602 LNCS, Issue , 2011, Pages 419-438

  Murawski, Andrzej S ^a   Tzevelekos, Nikos ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BISIMILARITY; CONTEXTUAL EQUIVALENCE; FIRST-ORDER; GAME SEMANTICS;

COMPUTABILITY AND DECIDABILITY;

SEMANTICS;

EID: 79953166828     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19718-5_22     Document Type: Conference Paper

References (17)

1. Abramsky, S., McCusker, G.: Call-by-value games. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol. 1414, pp. 1-17. Springer, Heidelberg (1998)
2. Ahmed, A., Dreyer, D., Rossberg, A.: State-dependent representation independence. In: Proc. of POPL, pp. 340-353. ACM, New York (2009)
3. Bojańczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: Proceedings of LICS, pp. 7-16 (2006)
4. Dreyer, D., Neis, G., Birkedal, L.: The impact of higher-order state and control effects on local relational reasoning. In: Proc. of ICFP, pp. 143-156. ACM, New York (2010)
5. Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13, 341-363 (2002)
6. Ghica, D.R.: Regular-language semantics for a call-by-value programming language. In: Proc. of MFPS. ENTCS, vol. 45. Elsevier, Amsterdam (2001)
7. Kaminski, M., Francez, N.: Finite-memory automata. Theor. Comput. Sci. 134(2), 329-363 (1994)
8. McCusker, G.: On the semantics of Idealized Algol without the bad-variable constructor. In: Proc. of MFPS. ENTCS, vol. 83. Elsevier, Amsterdam (2003)
9. Montanari, U., Pistore, M.: An introduction to history dependent automata. In: ENTCS vol. 10 (1997)
10. Murawski, A.S.: Functions with local state: regularity and undecidability. Theor. Comput. Sci. 338(1/3), 315-349 (2005)
11. Murawski, A.S., Ong, C.-H.L., Walukiewicz, I.: Idealized Algol with ground recursion and DPDA equivalence. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 917-929. Springer, Heidelberg (2005)
12. 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)
13. Murawski, A.S., Tzevelekos, N.: Block structure vs scope extrusion: between innocence and omniscience. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 33-47. Springer, Heidelberg (2010)
14. Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log. 5(3), 403-435 (2004)
15. Pitts, A.M., Stark, I.D.B.: Operational reasoning for functions with local state. In: Gordon, A.D., Pitts, A.M. (eds.) Higher-Order Operational Techniques in Semantics, pp. 227-273. Cambridge University Press, Cambridge (1998)
16. Stark, I.D.B.: Names and Higher-Order Functions. PhD thesis, University of Cambridge Computing Laboratory, Technical Report No. 363 (1995)
17. Tzevelekos, N.: Fresh-register automata. In: Proceedings of POPL. ACM, New York (2011)