The idea for this book was suggested by Bill Cobern. We would like to thank him for his
encouragement and support. A number of people assisted in the preparation of this book …

We present an axiomatic framework for Girard's Geometry of Interaction based on the notion
of linear combinatory algebra. We give a general construction on traced monoidal …

This paper introduces ctrees, a monad for modeling nondeterministic, recursive, and impure
programs in Coq. Inspired by Xia et al.'s itrees, this novel data structure embeds …

A category of HO/N-style games and probabilistic strategies is developed where the
possible choices of a strategy are quantified so as to give a measure of the likelihood of …

A bi category of very general nondeterministic concurrent games and strategies is
presented. The intention is to formalize distributed games in which both Player (or a team of …

Compositionality is at the core of programming languages research and has become an
important goal toward scalable verification of large systems. Despite that, there is no …

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 …

In 2011, Rideau and Winskel introduced concurrent games and strategies as event
structures, generalizing prior work on causal formulations of games. In this paper we give a …

In this paper we provide an interpretation of Aristotle's rule for the universal quantifier in
Topics Θ 157a34–37 and 160b1–6 in terms of Paul Lorenzen's dialogical logic. This is …

Concurrent abstraction layers are ubiquitous in modern computer systems because of the
pervasiveness of multithreaded programming and multicore hardware. Abstraction layers …