The notion of innocent strategy was introduced by Hyland and Ong in order to capture the
interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an …

This paper presents persistent Turing machines (PTMs), a new way of interpreting Turing-
machine computation, based on dynamic stream semantics. A PTM is a Turing machine that …

We construct a denotational model of propositional linear logic based on asynchronous
games and winning uniform innocent strategies. Every formula A is interpreted as an …

In game semantics, the higher-order value passing mechanisms of the λ-calculus are
decomposed as sequences of atomic actions exchanged by a Player and its Opponent …

Asynchronous circuits behave like concurrent programs implemented in hardware logic. The
processes in such circuits are synchronised in accordance with the dynamic logical and …

In game semantics, one expresses the higher-order value passing mechanisms of the λ-
calculus as sequences of atomic actions exchanged by a Player and its Opponent in the …

By extending nondeterministic transition systems with concurrency and copy mechanisms,
Axiomatic Rewriting Theory provides a uniform framework for a variety of rewriting systems …

A semantics of concurrent programs can be given using precubical sets, in order to study
(higher) commutations between the actions, thus encoding the" geometry" of the space of …

One key property of the/spl lambda/-calculus is that there exists a minimal computation (the
head-reduction) M/spl rarr//sup e/V from a/spl lambda/-term M to the set of its head-normal …

We present Persistent Turing Machines (PTMs), a new way of interpreting Turing-machine
computation, one that is both interactive and persistent. We show that the class of PTMs is …