Algorithmic Games for Full Ground References

  • Andrzej S. Murawski
  • Nikos Tzevelekos
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7392)

Abstract

We present a full classification of decidable and undecidable cases for contextual equivalence in a finitary ML-like language equipped with full ground storage (both integers and reference names can be stored). The simplest undecidable type is unit → unit → unit. At the technical level, our results marry game semantics with automata-theoretic techniques developed to handle infinite alphabets. On the automata-theoretic front, we show decidability of the emptiness problem for register pushdown automata extended with fresh-symbol generation.

Keywords

Typing Judgment Register Assignment Game Semantic Algorithmic Game Full Ground 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)Google Scholar
  2. 2.
    Abramsky, S., McCusker, G.: Call-by-Value Games. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol. 1414, pp. 1–17. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  3. 3.
    Ahmed, A., Dreyer, D., Rossberg, A.: State-dependent representation independence. In: POPL, pp. 340–353 (2009)Google Scholar
  4. 4.
    Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC, pp. 202–211 (2004)Google Scholar
  5. 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)CrossRefGoogle Scholar
  6. 6.
    Cheng, E.Y.C., Kaminski, M.: Context-free languages over infinite alphabets. Acta Inf. 35(3), 245–267 (1998)MathSciNetMATHCrossRefGoogle Scholar
  7. 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)Google Scholar
  8. 8.
    Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Asp. Comput. 13, 341–363 (2002)MATHCrossRefGoogle Scholar
  9. 9.
    Honda, K., Yoshida, N.: Game-theoretic analysis of call-by-value computation. TCS 221(1-2), 393–456 (1999)MathSciNetMATHCrossRefGoogle Scholar
  10. 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)CrossRefGoogle Scholar
  11. 11.
    Jeffrey, A., Rathke, J.: Towards a theory of bisimulation for local names. In: LICS (1999)Google Scholar
  12. 12.
    Kozen, D.: Automata and Computability. Springer (1997)Google Scholar
  13. 13.
    Koutavas, V., Wand, M.: Small bisimulations for reasoning about higher-order imperative programs. In: POPL, pp. 141–152 (2006)Google Scholar
  14. 14.
    Laird, J.: A game semantics of names and pointers. APAL 151, 151–169 (2008)MathSciNetMATHGoogle Scholar
  15. 15.
    Murawski, A.S.: Functions with local state: regularity and undecidability. TCS 338 (2005)Google Scholar
  16. 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)CrossRefGoogle Scholar
  17. 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)CrossRefGoogle Scholar
  18. 18.
    Murawski, A.S., Tzevelekos, N.: Game semantics for good general references. In: LICS (2011)Google Scholar
  19. 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)Google Scholar
  20. 20.
    Reddy, U.S., Yang, H.: Correctness of data representations involving heap data structures. Sci. Comput. Program. 50(1-3), 129–160 (2004)MathSciNetMATHCrossRefGoogle Scholar
  21. 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)Google Scholar
  22. 22.
    Tzevelekos, N.: Full abstraction for nominal general references. LMCS 5(3:8) (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Andrzej S. Murawski
    • 1
  • Nikos Tzevelekos
    • 2
  1. 1.University of LeicesterUK
  2. 2.Queen Mary, University of LondonUK

Personalised recommendations