Nominal Game Semantics

Murawski, Andrzej S.; Tzevelekos, Nikos

doi:10.1561/2500000017

Cited by 12 publications

(8 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, research on the -calculus has led to significant developments in different directions, including memory references (e.g. [Jeffrey and Rathke 1999;Laird 2004;Murawski and Tzevelekos 2016]) and cryptographic protocols (e.g. [Sumii and Pierce 2003]).…”

Section: Related Work and Context 61 Names In Computer Science And Smentioning

confidence: 99%

Probabilistic programming semantics for name generation

Sabok

Staton

Stein

et al. 2021

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

We make a formal analogy between random sampling and fresh name generation. We show that quasi-Borel spaces, a model for probabilistic programming, can soundly interpret the ν-calculus, a calculus for name generation. Moreover, we prove that this semantics is fully abstract up to first-order types. This is surprising for an ‘off-the-shelf’ model, and requires a novel analysis of probability distributions on function spaces. Our tools are diverse and include descriptive set theory and normal forms for the ν-calculus.

show abstract

Section: Related Work and Context 61 Names In Computer Science And Smentioning

confidence: 99%

Probabilistic programming semantics for name generation

Sabok

Staton

Stein

et al. 2021

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…Game semantics views computation as a dialogue between the environment (Opponent, O ) and the program (Proponent, P ). We give an overview of the fully abstract game model of [28]. Let be a collection of countably infinite sets of reference names , or just names .…”

Section: Game Semanticsmentioning

confidence: 99%

“…Then, in Sect. 3 we introduce the game model of GRef (we refer the interested reader to [28] for a detailed account of the model, which is in effect a restricted version of game models for larger languages presented in [19,24]). The first main results are obtained in Sect.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Algorithmic games for full ground references

Murawski

Tzevelekos

2017

Form Methods Syst Des

Self Cite

View full text Add to dashboard Cite

We present a full classification of decidable and undecidable cases for contextual equivalence in a finitary ML-like language equipped with full ground storage (both integers and reference names can be stored). The simplest undecidable type is unit → unit → unit. At the technical level, our results marry game semantics with automata-theoretic techniques developed to handle infinite alphabets. On the automata-theoretic front, we show decidability of the emptiness problem for register pushdown automata extended with fresh-symbol generation.

show abstract

“…E.g., depending on the considered language, various constraints are imposed upon strategies, like innocence or well-bracketing. Further sources of diversity have appeared with recent extensions, e.g., sheaf-based innocence [37], nominal models [32], tensorial logic [30], or concurrent extensions [18,34].…”

Section: Introductionmentioning

confidence: 99%

What's in a game?

Eberhart

Hirschowitz

2018

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science

View full text Add to dashboard Cite

Game semantics is a rich and successful class of denotational models for programming languages. Most game models feature a rather intuitive setup, yet surprisingly di cult proofs of such basic results as associativity of composition of strategies. We set out to unify these models into a basic abstract framework for game semantics, game settings. Our main contribution is the generic construction, for any game setting, of a category of games and strategies. Furthermore, we extend the framework to deal with innocence, and prove that innocent strategies form a subcategory. We nally show that our constructions cover many concrete cases, mainly among the early models [6, 20] and the very recent sheaf-based ones [37].

show abstract

Nominal Game Semantics

Cited by 12 publications

References 18 publications

Probabilistic programming semantics for name generation

Probabilistic programming semantics for name generation

Algorithmic games for full ground references

What's in a game?

Contact Info

Product

Resources

About