3 papers
cs.LO2021
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…
cs.PL2020
Game Semantics: Easy as Pi
Nobuko Yoshida, Simon Castellan, Léo Stefanesco
Game semantics has proven to be a robust method to give compositional semantics for a variety of higher-order programming languages. However, due to the complexity of most game mod…
cs.LO2019
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…