Least and Greatest Fixpoints in Game Semantics. - Pierre Clairambault (FoSSaCS, 2009)

Totality in arena games. - Pierre Clairambault; Russ Harmer (Ann. Pure Appl. Log., 2010)

Logique et Interaction : une Étude Sémantique de la Totalité. (Logic and Interaction : a Semantic Study of Totality). - Pierre Clairambault (2010)

Estimation of the Length of Interactions in Arena Game Semantics. - Pierre Clairambault (FoSSaCS, 2011)

Isomorphisms of Types in the Presence of Higher-Order References. - Pierre Clairambault (LICS, 2011)

The Winning Ways of Concurrent Games. - Pierre Clairambault; Julian Gutierrez 001; Glynn Winskel (LICS, 2012)

Isomorphisms of types in the presence of higher-order references (extended version) - Pierre Clairambault (Log. Methods Comput. Sci., 2012)

Imperfect Information in Logic and Concurrent Games. - Pierre Clairambault; Julian Gutierrez 001; Glynn Winskel (Computation, Logic, Games, and Quantum Foundations, 2013)

Böhm Trees as Higher-Order Recursive Schemes. - Pierre Clairambault; Andrzej S. Murawski (FSTTCS, 2013)

Bounding Skeletons, Locally Scoped Terms and Exact Bounds for Linear Head Reduction. - Pierre Clairambault (TLCA, 2013)

On Concurrent Games with Payoff. - Pierre Clairambault; Glynn Winskel (MFPS, 2013)

Strong functors and interleaving fixpoints in game semantics. - Pierre Clairambault (RAIRO Theor. Informatics Appl., 2013)

Symmetry in concurrent games. - Simon Castellan; Pierre Clairambault; Glynn Winskel (CSL-LICS, 2014)

Concurrent Hyland-Ong games. - Simon Castellan; Pierre Clairambault; Glynn Winskel (CoRR, 2014)

The biequivalence of locally cartesian closed categories and Martin-Löf type theories. - Pierre Clairambault; Peter Dybjer (Math. Struct. Comput. Sci., 2014)

Game Semantics and Normalization by Evaluation. - Pierre Clairambault; Peter Dybjer (FoSSaCS, 2015)

The Parallel Intensionally Fully Abstract Games Model of PCF. - Simon Castellan; Pierre Clairambault; Glynn Winskel (LICS, 2015)

Undecidability of Equality in the Free Locally Cartesian Closed Category. - Simon Castellan; Pierre Clairambault; Peter Dybjer (TLCA, 2015)

Bounding linear head reduction and visible interaction through skeletons. - Pierre Clairambault (Log. Methods Comput. Sci., 2015)

Causality vs. Interleavings in Concurrent Game Semantics. - Simon Castellan; Pierre Clairambault (CONCUR, 2016)

Concurrent Games. - Simon Castellan; Pierre Clairambault; Silvain Rideau; Glynn Winskel (CoRR, 2016)

Distributed Strategies Made Easy. - Simon Castellan; Pierre Clairambault; Glynn Winskel (MFCS, 2017)

Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or. - Simon Castellan; Pierre Clairambault; Glynn Winskel (FSCD, 2017)

Undecidability of Equality in the Free Locally Cartesian Closed Category (Extended version). - Simon Castellan; Pierre Clairambault; Peter Dybjer (Log. Methods Comput. Sci., 2017)

Games and Strategies as Event Structures. - Simon Castellan; Pierre Clairambault; Silvain Rideau; Glynn Winskel (Log. Methods Comput. Sci., 2017)

The True Concurrency of Herbrand's Theorem. - Aurore Alcolei; Pierre Clairambault; Martin Hyland; Glynn Winskel (CSL, 2018)

Fully Abstract Models of the Probabilistic lambda-calculus. - Pierre Clairambault; Hugo Paquet (CSL, 2018)

Non-angelic Concurrent Game Semantics. - Simon Castellan; Pierre Clairambault; Jonathan Hayman; Glynn Winskel (FoSSaCS, 2018)

The concurrent game semantics of Probabilistic PCF. - Simon Castellan; Pierre Clairambault; Hugo Paquet; Glynn Winskel (LICS, 2018)

Linearity in higher-order recursion schemes. - Pierre Clairambault; Charles Grellois; Andrzej S. Murawski (Proc. ACM Program. Lang., 2018)

Resource-Tracking Concurrent Games. - Aurore Alcolei; Pierre Clairambault; Olivier Laurent 001 (FoSSaCS, 2019)

On the Expressivity of Linear Recursion Schemes. - Pierre Clairambault; Andrzej S. Murawski (MFCS, 2019)

Concurrent Quantum Strategies. - Pierre Clairambault; Marc de Visme; Glynn Winskel (RC, 2019)

Categories with Families: Unityped, Simply Typed, and Dependently Typed. - Simon Castellan; Pierre Clairambault; Peter Dybjer (CoRR, 2019)

Thin Games with Symmetry and Concurrent Hyland-Ong Games. - Simon Castellan; Pierre Clairambault; Glynn Winskel (Log. Methods Comput. Sci., 2019)

Game semantics for quantum programming. - Pierre Clairambault; Marc de Visme; Glynn Winskel (Proc. ACM Program. Lang., 2019)

Learning to Count up to Symmetry. - Pierre Clairambault (CoRR, 2020)

Full abstraction for the quantum lambda-calculus. - Pierre Clairambault; Marc de Visme (Proc. ACM Program. Lang., 2020)

Positional Injectivity for Innocent Strategies. - Lison Blondeau-Patissier; Pierre Clairambault (FSCD, 2021)

The Quantitative Collapse of Concurrent Games with Symmetry. - Pierre Clairambault; Hugo Paquet (CoRR, 2021)

The Mays and Musts of Concurrent Strategies. - Simon Castellan; Pierre Clairambault; Glynn Winskel (CoRR, 2021)

Strategies as Resource Terms, and Their Categorical Semantics. - Lison Blondeau-Patissier; Pierre Clairambault; Lionel Vaux Auclair (FSCD, 2023)

The Cartesian Closed Bicategory of Thin Spans of Groupoids. - Pierre Clairambault; Simon Forest (LICS, 2023)

From Thin Concurrent Games to Generalized Species of Structures. - Pierre Clairambault; Federico Olimpieri; Hugo Paquet (LICS, 2023)

Extensional Taylor Expansion. - Lison Blondeau-Patissier; Pierre Clairambault; Lionel Vaux Auclair (CoRR, 2023)

The Geometry of Causality: Multi-token Geometry of Interaction and Its Causal Unfolding. - Simon Castellan; Pierre Clairambault (Proc. ACM Program. Lang., 2023)

Causal Investigations in Interactive Semantics. - Pierre Clairambault (2024)

An Analysis of Symmetry in Quantitative Semantics. - Pierre Clairambault; Simon Forest (LICS, 2024)

The Qualitative Collapse of Concurrent Games. - Pierre Clairambault (CoRR, 2024)

Disentangling Parallelism and Interference in Game Semantics. - Simon Castellan; Pierre Clairambault (Log. Methods Comput. Sci., 2024)