activity
20142026
most citedGames and Strategies as Event Structures

11 citations · 19 across the 8 of their papers we have counts for

collaborators

11 papers

cs.LO2026

Wiring the Pi-calculus to Denotational Semantics

Ken Sakayori, Davide Sangiorgi, Simon Castellan +1

We introduce a dialect of the Asynchronous pi-calculus, called AWpi, in which (1) an input name may be owned, at any time, by at most one process; (2) each name has either only the…

math.RT2025

Non-homogeneous Koszul duality in representation theory

Gwyn Bellamy, Simone Castellan, Isambard Goodbody

Motivated by the representation theory of symplectic reflection algebras, deformed preprojective algebras, and graded Hecke algebras, we consider filtered algebras whose associ…

math.RA2023★ 1 cited

Automorphism groups of deformations and quantizations of Kleinian singularities

Simone Castellan

It is known that, for the algebra of functions on a Kleinian singularity, the parameter space of deformations and the parameter space of quantizations coincide. We prove that, for…

math.QA2023

-Vertex algebras and chiralization of star products

Simone Castellan

We develop the theory of -vertex algebras, algebraic structures closely related to vertex algebras but with a deformed translation covariance axiom. We establish their struc…

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.LO2021

Disentangling Parallelism and Interference in Game Semantics

Simon Castellan, Pierre Clairambault

Game semantics is a denotational semantics presenting compositionally the computational behaviour of various kinds of effectful programs. One of its celebrated achievement is to ha…

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…

math.LO2016★ 11 cited

Games and Strategies as Event Structures

Simon Castellan, Pierre Clairambault, Silvain Rideau +1

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

cs.LO2015

Undecidability of Equality in the Free Locally Cartesian Closed Category (Extended version)

Simon Castellan, Pierre Clairambault, Peter Dybjer

We show that a version of Martin-Löf type theory with an extensional identity type former I, a unit type N1 , Sigma-types, Pi-types, and a base type is a free category with familie…

cs.LO2014★ 7 cited

Thin Games with Symmetry and Concurrent Hyland-Ong Games

Simon Castellan, Pierre Clairambault, Glynn Winskel

We build a cartesian closed category, called Cho, based on event structures. It allows an interpretation of higher-order stateful concurrent programs that is refined and precise: o…