Relative sequentiality

Observable Sequentiality and Full Abstraction 1 Full Abstraction and Sequentiality

One of the major challenges in denotational semantics is the construction of fully abstract models for sequential programming languages. For the past fteen years, research on this problem has focused on developing models for PCF, an idealized functional programming language based on the typed lambda calculus. Unlike most practical languages, PCF has no facilities for observing and exploiting th...

Sequentiality and the π-calculus

A Logic of Sequentiality

Game semantics has been used to interpret both proofs and functional programs: an important further development on the programming side has been to model higher-order programs with state by allowing strategies with “history-sensitive” behaviour. In this paper, we develop a detailed analysis of the structure of these strategies from a logical perspective by showing that they correspond to proofs...

Sequentiality byLinear Implicationand UniversalQuantification

In this paper we address the issue of understanding sequential and parallel composition of agents from a logical viewpoint. We use the methodology of abstract logic programming in linear logic, where computations are proof searches in a suitable fragment of linear logic. While parallel composition has a straightforward treatment in this setting, sequential composition is much more diicult to be...

Sequentiality in Bounded Biorders

We study a notion of bounded stable biorder, showing that the monotone and stable functions on such biorders are sequential. We construct bounded biorder models of a range of sequential, higher-order functional calculi, including unary PCF, (typed and untyped) call-by-value and lazy λ-calculi, and non-deterministic SPCF. We prove universality and full abstraction results for these models by red...