Repetitive and ambiguous visual structures in general pose a severe problem in many
computer vision applications. Identification of incorrect geometric relations between images …

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

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 …

Quantum programming languages permit a hardware independent, high-level description of
quantum algo rithms. In particular, the quantum lambda-calculus is a higher-order …

Game semantics and session types are two formalisations of the same concept: message-
passing open programs following certain protocols. Game semantics represents protocols …

Formal methods have advanced to the point where the functional correctness of various
large system components has been mechanically verified. However, the diversity of …

We show how to construct the category of games and innocent strategies from a more
primitive category of games. On that category we define a comonad and monad with the …

We describe a framework for truly concurrent game semantics of programming languages,
based on Rideau and Winskel's concurrent games on event structures. The model supports …