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… Expand

This paper focuses on quantum information protocols, which exploit quantum-mechanical effects in an essential way and form the basis for novel and potentially very important applications to secure and fault-tolerant communication and computation.Expand

An intensional model for the programming language PCF is described, in which the types of PCF are interpreted by games, and the terms by certain "history-free" strategies. This model is shown to… Expand

Domain theory, the mathematical theory of computation introduced by Scott as a foundation for detonational semantics, and the theory of concurrency and systems behaviour developed by Milner, Hennesy based on operational semantics are introduced.Expand

Girard's linear logic is studied from the point of view of giving a concrete computational interpretation of the logic, based on the Curry—Howard isomorphism, which opens up a promising new approach to the parallel implementation of functional programming languages.Expand

It is shown that contextuality, and non-locality as a special case, correspond exactly to obstructions to the existence of global sections, and a linear algebraic approach to computing these obstructions is described, which allows a systematic treatment of arguments for non- Locality and contextuality.Expand

We present a game semantics for Linear Logic, in which formulas denote games and proofs denote winning strategies. We show that our semantics yields a categorical model of Linear Logic and prove full… Expand

A novel semantics for Idealized Algol is presented using games, which takes into account the irreversibility of changes in state, and makes explicit the difference between copying and sharing of entities.Expand