We present a formal correspondence between Laird’s trace semantics and the nominal game model of Murawski and Tzevelekos for RefML, a callby-value language with higher-order references. This gives an operational flavor to game semantics, where denotation of terms is generated via an interactive reduction, which allows to reduce terms with free functional variables, and where pointer structure is represented with name pointers. It also leads to transferring the categorical structure defined on the game model to the trace model. Then, representing the notion of view from game semantics in terms of available name pointers, we restrict our trace semantics to GroundML, a language with firstorder references and show its full abstraction using a correspondence with visible strategies. This gives the first fully abstract trace model for this language.


Functional Type Operational Semantic Game Model Label Transition System Typing Judgment 
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.


  1. 1.
    Abramsky, S., Ghica, D., Murawski, A., Ong, L., Stark, I.: Nominal games and full abstraction for the nu-calculus. In: Proceedings of LICS 2004, pp. 150–159. IEEE (2004)Google Scholar
  2. 2.
    Abramsky, S., Honda, K., McCusker, G.: A fully abstract game semantics for general references. In: Proceedings of LICS 1998, pp. 334–344. IEEE (1998)Google Scholar
  3. 3.
    Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Information and Computation 163(2), 409–470 (2000)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Gabbay, M., Ghica, D.: Game semantics in the nominal model. In: Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2012). Electronic Notes in Theoretical Computer Science, vol. 286, pp. 173–189. Elsevier (2012)Google Scholar
  5. 5.
    Gabbay, M., Pitts, A.: A new approach to abstract syntax with variable binding. Formal Aspects of computing 13(3-5), 341–363 (2002)CrossRefzbMATHGoogle Scholar
  6. 6.
    Hyland, M., Ong, L.: On full abstraction for PCF: I, II and III. Information and Computation 163(2), 285–408 (2000)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Jaber, G.: A Logical Study of Program Equivalence. PhD thesis, École des Mines de Nantes (2014)Google Scholar
  8. 8.
    Laird, J.: A game semantics of the asynchronous p-calculus. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 51–65. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Laird, J.: A fully abstract trace semantics for general references. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 667–679. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  10. 10.
    Laird, J.: A game semantics of names and pointers. Annals of Pure and Applied Logic 151(2), 151–169 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Laird, J.: Game semantics for call-by-value polymorphism. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 187–198. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  12. 12.
    Levy, P., Staton, S.: Transition systems over games. In: Proceedings of LICS 2014, pp. 64:1–64:10 (2014)Google Scholar
  13. 13.
    Murawski, A., Tzevelekos, N.: Game semantics for good general references. In: Proceedings of LICS 2011, pp. 75–84. IEEE (2011)Google Scholar
  14. 14.
    Murawski, A., Tzevelekos, N.: Algorithmic games for full ground references. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol. 7392, pp. 312–324. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  15. 15.
    Murawski, A., Tzevelekos, N.: Full abstraction for reduced ml. Annals of Pure and Applied Logic (2013)Google Scholar
  16. 16.
    Power, J., Thielecke, H.: Closed freyd- and κ-categories. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 625–634. Springer, Heidelberg (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Guilhem Jaber
    • 1
  1. 1.Queen Mary University of LondonLondonUK

Personalised recommendations