Game Semantics for Good General References

We present a new fully abstract and effectively presentable denotational model for RefML, a paradigmatic higher-order programming language combining call-by-value evaluation and general references in the style of ML. Our model is built using game semantics. In contrast to the previous model by Abramsky, Honda and McCusker, it provides a faithful account of reference types, and the full abstraction result does not rely on the availability of spurious constructs of reference type (bad variables). This is the first denotational model of this kind, preceded only by the trace model recently proposed by Laird [16].

[1]  Derek Dreyer,et al.  State-dependent representation independence , 2009, POPL '09.

[2]  Mitchell Wand,et al.  Small bisimulations for reasoning about higher-order imperative programs , 2006, POPL '06.

[3]  Nobuko Yoshida,et al.  Game-Theoretic Analysis of Call-by-Value Computation , 1997, Theor. Comput. Sci..

[4]  Nicolas Tabareau,et al.  An Algebraic Account of References in Game Semantics , 2009, MFPS.

[5]  Andrew M. Pitts,et al.  Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new? , 1993, MFCS.

[6]  Nikos Tzevelekos,et al.  Full abstraction for nominal general references , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[7]  C.-H. Luke Ong,et al.  Fully abstract semantics of additive aspects by translation , 2007, AOSD.

[8]  Nobuko Yoshida,et al.  Logical Reasoning for Higher-Order Functions with Local State , 2008, Log. Methods Comput. Sci..

[9]  James Laird.  A game semantics of names and pointers , 2008, Ann. Pure Appl. Log..

[10]  Samson Abramsky,et al.  Call-by-Value Games , 1997, CSL.

[11]  Ian David Bede Stark,et al.  Names and higher-order functions , 1994 .

[12]  James Laird.  A Fully Abstract Trace Semantics for General References , 2007, ICALP.

[13]  Andrew M. Pitts,et al.  A New Approach to Abstract Syntax with Variable Binding , 2002, Formal Aspects of Computing.

[14]  Nathaniel Charlton,et al.  A decidable class of verification conditions for programs with higher order store , 2009, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[15]  Andrzej S. Murawski,et al.  Applying Game Semantics to Compositional Software Modeling and Verification , 2004, TACAS.

[16]  Paul Blain Levy,et al.  Possible World Semantics for General Storage in Call-By-Value , 2002, CSL.

[17]  James Laird.  Game Semantics for Call-by-Value Polymorphism , 2010, ICALP.

[18]  James Laird.  Game Semantics for Higher-Order Concurrency , 2006, FSTTCS.

[19]  John C. Reynolds,et al.  The essence of ALGOL , 1997 .

[20]  Andrzej S. Murawski,et al.  Full abstraction for Reduced ML , 2013, Ann. Pure Appl. Log..

[21]  Lars Birkedal,et al.  Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types , 2009, FoSSaCS.

[22]  Hongseok Yang,et al.  Nested Hoare Triples and Frame Rules for Higher-Order Store , 2009, CSL.

[23]  Davide Sangiorgi,et al.  Environmental Bisimulations for Higher-Order Languages , 2007, LICS.

[24]  Lars Birkedal,et al.  Relational Reasoning for Recursive Types and References , 2006, APLAS.

[25]  Luca Cardelli,et al.  Comparing Object Encodings , 1997, Inf. Comput..

[26]  Paul Blain Levy,et al.  Typed Normal Form Bisimulation for Parametric Polymorphism , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[27]  Davide Sangiorgi,et al.  Environmental Bisimulations for Higher-Order Languages , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[28]  Lars Birkedal,et al.  The impact of higher-order state and control effects on local relational reasoning , 2012, J. Funct. Program..

[29]  Paul Blain Levy.  Global State Considered Helpful , 2008, MFPS.

[30]  Lars Birkedal,et al.  Realisability semantics of parametric polymorphism, general references and recursive types , 2010, Mathematical Structures in Computer Science.

[31]  Samson Abramsky,et al.  A fully abstract game semantics for general references , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[32]  Dan R. Ghica,et al.  The regular-language semantics of second-order idealized ALGOL , 2003, Theor. Comput. Sci..

[33]  Andrzej S. Murawski,et al.  Nominal games and full abstraction for the nu-calculus , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..