Game Semantics for Good General References

Authors:
Andrzej S. Murawski;Nikos Tzevelekos
Affiliations:
-;-
Venue:
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Year:
2011

Citing 0
Cited 5

The marriage of bisimulations and Kripke logical relations

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Program equivalence in a simple language with state

Computer Languages, Systems and Structures
Algorithmic games for full ground references

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Deconstructing general references via game semantics

FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Game semantics for interface middleweight Java

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

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].