Algorithmic Nominal Game Semantics
نویسندگان
چکیده
We employ automata over infinite alphabets to capture the semantics of a finitary fragment of ML with ground-type references. Our approach is founded on game semantics, which allows us to translate programs into automata in such a way that contextual equivalence is characterized by a finitary notion of bisimilarity. As a corollary, we derive a decidability result for a class of first-order programs, including open ones that contain unspecified first-order procedures.
منابع مشابه
Nominal Game Semantics
These tutorial notes present nominal game semantics, a denotational technique for modelling higher-order programs. A. S. Murawski and N. Tzevelekos. Nominal Game Semantics. Foundations and TrendsR © in Programming Languages, vol. 2, no. 4, pp. 191–269, 2015. DOI: 10.1561/2500000017.
متن کاملComputing Science Group FULL ABSTRACTION FOR NOMINAL EXCEPTIONS AND GENERAL REFERENCES
Game semantics has been used with considerable success in formulating fully abstract semantics for languages with higher-order procedures and a wide range of computational effects. Recently, nominal games have been proposed for modeling functional languages with names and nominal general references. Here we make a step further by developing a fully abstract semantics for a language with nominal...
متن کاملComputing Science Group Nominal Game Semantics
Game Semantics arguably stands for one of the most successful techniques in denotational semantics, having provided not only proper denotational, accurate models for a large variety of programming languages, but also new semantical tools for program verification and validation. Most of all, over the last couple of decades, game semantics has contributed a novel understanding of computations, na...
متن کاملGame Semantics for Nominal Exceptions
We present a fully abstract denotational model for a higher-order programming language combining call-by-value evaluation and local exceptions. The model is built using nominal game semantics and is the first one to achieve both effective presentability and freedom from “bad exception” constructs.
متن کاملOperational Nominal Game Semantics
We present a formal correspondence between Laird’s trace semantics and the nominal game model of Murawski and Tzevelekos for RefML, a callby-value language with higher-order references. This gives an operational flavor to game semantics, where denotation of terms is generated via an interactive reduction, which allows to reduce terms with free functional variables, and where pointer structure i...
متن کامل