5 papers
The Mays and Musts of Concurrent Strategies
Simon Castellan, Pierre Clairambault, Glynn Winskel
Concurrent strategies based on event structures are examined from the viewpoint of 'may' and 'must' testing in traditional process calculi. In their pure form concurrent strategies…
The Quantitative Collapse of Concurrent Games with Symmetry
Pierre Clairambault, Hugo Paquet
We explore links between the thin concurrent games of Castellan, Clairambault and Winskel, and the weighted relational models of linear logic studied by Laird, Manzonetto, McCusker…
Positional Injectivity for Innocent Strategies
Lison Blondeau-Patissier, Pierre Clairambault
In asynchronous games, Melli{è}s proved that innocent strategies are positional: their behaviour only depends on the position, not the temporal order used to reach it. This insight…
Learning to Count up to Symmetry
Pierre Clairambault
In this paper we develop the theory of how to count, in thin concurrent games, the configurations of a strategy witnessing that it reaches a certain configuration of the game. This…
Categories with Families: Unityped, Simply Typed, and Dependently Typed
Simon Castellan, Pierre Clairambault, Peter Dybjer
We show how the categorical logic of untyped, simply typed and dependently typed lambda calculus can be structured around the notion of category with family (cwf). To this end we i…