A Fully Abstract Game Semantics for Finite Nondeterminism

  title={A Fully Abstract Game Semantics for Finite Nondeterminism},
  author={Russell Harmer and Guy McCusker},
A game semantics of finite nondeterminism is proposed. In this model, a strategy may make a choice between different moves in a given situation; moreover, strategies carry extra information about their possible divergent behaviou r. A Cartesian closed category is built and a model of a simple, higher-order nondeterministic imperative language i s given. This model is shown to be fully abstract, with respect to an equivalence based on both safety and liveness properties, by means of a… CONTINUE READING
Highly Cited
This paper has 88 citations. REVIEW CITATIONS
56 Citations
17 References
Similar Papers


Publications citing this paper.

89 Citations

Citations per Year
Semantic Scholar estimates that this publication has 89 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 17 references

Game semantics. Lecture notes to accompany Samson Abramsky’s lectures at the 1997 Marktoberdorf summer school

  • S. Abramsky, G. McCusker
  • To appear,
  • 1998
1 Excerpt

Bireflectivity. InMathematical Foundations of Programming Semantics

  • P. J. Freyd, P. W. O’Hearn, A. J. Power, M. Takeyama, R. D. Tennent
  • Eleventh Annual Conference,
  • 1995
1 Excerpt

Similar Papers

Loading similar papers…