Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions

  title={Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions},
  author={Samson Abramsky and Guy McCusker},
  journal={Electron. Notes Theor. Comput. Sci.},
Game Semantics for a Polymorphic Programming Language
  • J. Laird
  • Computer Science
    2010 25th Annual IEEE Symposium on Logic in Computer Science
  • 2010
A fully abstract game semantics for an idealized programming language with local state and higher rank polymorphism --- System F extended with general references --- is described, and proves definability of finite elements, and thus a full abstraction result, using a decomposition argument.
A Game Semantics of Idealized CSP
The Regular-Language Semantics of First-Order Idealized Algol
It is explained how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol by expressing sets of complete plays as regular languages using a meta-language of extended regular expressions, a language for which equivalence is decidable.
The regular-language semantics of second-order idealized ALGOL
A semantic analysis of control
This thesis examines the use of denotational semantics to reason about control flow in sequential, basically functional languages, and establishes decidability of observational equivalence for finitary PCF, contrasting with the undecidable of the analogous relation in pure PCF.
A Fully Abstract Game Semantics for Parallelism with Non-Blocking Synchronization on Shared Variables
A fully abstract game semantics for an Algol-like parallel language with non-blocking synchronization primitive and a game framework appropriate for modeling parallelism is developed.
May & Must-Equivalence of Shared Variable Parallel Programs in Game Semantics
The game semantics for the Algol-like parallel language is shown to be fully abstract, which indicates that the parallel command of the AlGol- like language adds no extra power than non- determinism provided by EIA.
Game semantics and linear CPS interpretation
  • J. Laird
  • Computer Science
    Theor. Comput. Sci.
  • 2005
An Algebraic Account of References in Game Semantics


Full Abstraction for PCF
The effective version of the model is considered and it is proved that every element of the effective extensional model is definable in PCF, which is the first syntax-independent description of the fully abstract model for PCF.
Names and higher-order functions
This dissertation looks in detail at the addition to a functional language of dynamically generated names, an extension of the simply-typed lambdacalculus, which is equivalent to a certain fragment of Standard ML, omitting side-effects, exceptions, datatypes and recursion.
Games and Full Abstraction for a Functional Metalanguage with Recursive Types
This book discusses FPC and its Models, Rational Categories and Recursive Types, and Semantics of the Recursion Combinator, as well as games and Strategies, and the author's own contributions.
Parametricity and local variables
This work uses relational parametricity to construct a model for an Algol-like language in which interactions between local and non-local entities satisfy certain relational criteria, and supports straightforward validations of all the test equivalences that have been proposed in the literature for local-variable semantics.
LCF Considered as a Programming Language
Domain theory
bases were introduced in [Smy77] where they are called “R-structures”. Examples of abstract bases are concrete bases of continuous domains, of course, where the relation≺ is the restriction of the
Denotational Semantics
  • P. Mosses
  • Computer Science
    Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990
Categories, types and structures - an introduction to category theory for the working computer scientist
This book introduces category theory at a level appropriate for computer scientists and provides practical examples in the context of programming language design and pursues the more complex mathematical semantics of data types and programs as objects and morphisms of categories.