Understanding game semantics through coherence spaces

Ana C Calderon, Guy A McCusker

Research output: Contribution to journalArticle

  • 4 Citations

Abstract

Game Semantics has successfully provided fully abstract models for a variety of programming languages not possible using other denotational approaches. Although it is a flexible and accurate way to give semantics to a language, its underlying mathematics is awkward. For example, the proofs that strategies compose associatively and maintain properties imposed on them such as innocence are intricate and require a lot of attention. This work aims at beginning to provide a more elegant and uniform mathematical ground for Game Semantics. Our quest is to find mathematical entities that will retain the properties that make games an accurate way to give semantics to programs, yet that are simple and familiar to work with. Our main result is a full, faithful strong monoidal embedding of a category of games into a category of coherence spaces, where composition is simple composition of relations.
LanguageEnglish
Pages231-244
Number of pages14
JournalElectronic Notes in Theoretical Computer Science
Volume265
DOIs
StatusPublished - 6 Sep 2010

Fingerprint

Game Semantics
Semantics
Game
Faithful
Programming Languages
Chemical analysis
Computer programming languages
Model
Strategy
Language

Cite this

Understanding game semantics through coherence spaces. / Calderon, Ana C; McCusker, Guy A.

In: Electronic Notes in Theoretical Computer Science, Vol. 265, 06.09.2010, p. 231-244.

Research output: Contribution to journalArticle

@article{31f797b0802048439996a49265feef13,
title = "Understanding game semantics through coherence spaces",
abstract = "Game Semantics has successfully provided fully abstract models for a variety of programming languages not possible using other denotational approaches. Although it is a flexible and accurate way to give semantics to a language, its underlying mathematics is awkward. For example, the proofs that strategies compose associatively and maintain properties imposed on them such as innocence are intricate and require a lot of attention. This work aims at beginning to provide a more elegant and uniform mathematical ground for Game Semantics. Our quest is to find mathematical entities that will retain the properties that make games an accurate way to give semantics to programs, yet that are simple and familiar to work with. Our main result is a full, faithful strong monoidal embedding of a category of games into a category of coherence spaces, where composition is simple composition of relations.",
author = "Calderon, {Ana C} and McCusker, {Guy A}",
note = "Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2010)",
year = "2010",
month = "9",
day = "6",
doi = "10.1016/j.entcs.2010.08.014",
language = "English",
volume = "265",
pages = "231--244",
journal = "Electronic Notes in Theoretical Computer Science",
issn = "1571-0661",
publisher = "Elsevier",

}

TY - JOUR

T1 - Understanding game semantics through coherence spaces

AU - Calderon,Ana C

AU - McCusker,Guy A

N1 - Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2010)

PY - 2010/9/6

Y1 - 2010/9/6

N2 - Game Semantics has successfully provided fully abstract models for a variety of programming languages not possible using other denotational approaches. Although it is a flexible and accurate way to give semantics to a language, its underlying mathematics is awkward. For example, the proofs that strategies compose associatively and maintain properties imposed on them such as innocence are intricate and require a lot of attention. This work aims at beginning to provide a more elegant and uniform mathematical ground for Game Semantics. Our quest is to find mathematical entities that will retain the properties that make games an accurate way to give semantics to programs, yet that are simple and familiar to work with. Our main result is a full, faithful strong monoidal embedding of a category of games into a category of coherence spaces, where composition is simple composition of relations.

AB - Game Semantics has successfully provided fully abstract models for a variety of programming languages not possible using other denotational approaches. Although it is a flexible and accurate way to give semantics to a language, its underlying mathematics is awkward. For example, the proofs that strategies compose associatively and maintain properties imposed on them such as innocence are intricate and require a lot of attention. This work aims at beginning to provide a more elegant and uniform mathematical ground for Game Semantics. Our quest is to find mathematical entities that will retain the properties that make games an accurate way to give semantics to programs, yet that are simple and familiar to work with. Our main result is a full, faithful strong monoidal embedding of a category of games into a category of coherence spaces, where composition is simple composition of relations.

UR - http://www.scopus.com/inward/record.url?scp=77956361142&partnerID=8YFLogxK

UR - http://dx.doi.org/10.1016/j.entcs.2010.08.014

U2 - 10.1016/j.entcs.2010.08.014

DO - 10.1016/j.entcs.2010.08.014

M3 - Article

VL - 265

SP - 231

EP - 244

JO - Electronic Notes in Theoretical Computer Science

T2 - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

SN - 1571-0661

ER -