Pierre Clairambault

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 34

Top Venues

CoRR

LICS

Proc. ACM Program. Lang.

Log. Methods Comput. Sci.

Paris Diderot University, France (PHD)

Education History

Paris Diderot University, France

PHD

Publications

Pierre Clairambault, Simon Forest
An Analysis of Symmetry in Quantitative Semantics. CoRR (2024)
Pierre Clairambault, Simon Forest
An Analysis of Symmetry in Quantitative Semantics. LICS (2024)
Lison Blondeau-Patissier, Pierre Clairambault, Lionel Vaux Auclair
Strategies as Resource Terms, and Their Categorical Semantics. FSCD (2023)
Pierre Clairambault, Federico Olimpieri, Hugo Paquet
From Thin Concurrent Games to Generalized Species of Structures. LICS (2023)
Pierre Clairambault, Simon Forest
The Cartesian Closed Bicategory of Thin Spans of Groupoids. CoRR (2023)
Lison Blondeau-Patissier, Pierre Clairambault, Lionel Vaux Auclair
Strategies as Resource Terms, and their Categorical Semantics. CoRR (2023)
Lison Blondeau-Patissier, Pierre Clairambault, Lionel Vaux Auclair
Extensional Taylor Expansion. CoRR (2023)
Pierre Clairambault, Simon Forest
The Cartesian Closed Bicategory of Thin Spans of Groupoids. LICS (2023)
Pierre Clairambault, Federico Olimpieri, Hugo Paquet
From Thin Concurrent Games to Generalized Species of Structures. CoRR (2023)
Simon Castellan, Pierre Clairambault
The Geometry of Causality: Multi-token Geometry of Interaction and Its Causal Unfolding. Proc. ACM Program. Lang. 7 (POPL) (2023)
Simon Castellan, Pierre Clairambault, Glynn Winskel
The Mays and Musts of Concurrent Strategies. CoRR (2021)
Lison Blondeau-Patissier, Pierre Clairambault
Positional Injectivity for Innocent Strategies. CoRR (2021)
Simon Castellan, Pierre Clairambault
Disentangling Parallelism and Interference in Game Semantics. CoRR (2021)
Lison Blondeau-Patissier, Pierre Clairambault
Positional Injectivity for Innocent Strategies. FSCD (2021)
Pierre Clairambault, Hugo Paquet
The Quantitative Collapse of Concurrent Games with Symmetry. CoRR (2021)
Pierre Clairambault
Learning to Count up to Symmetry. CoRR (2020)
Pierre Clairambault, Marc de Visme
Full abstraction for the quantum lambda-calculus. Proc. ACM Program. Lang. 4 (POPL) (2020)
Pierre Clairambault, Marc de Visme, Glynn Winskel
Game semantics for quantum programming. Proc. ACM Program. Lang. 3 (POPL) (2019)
Pierre Clairambault, Marc de Visme, Glynn Winskel
Concurrent Quantum Strategies. RC (2019)
Aurore Alcolei, Pierre Clairambault, Olivier Laurent
Resource-Tracking Concurrent Games. FoSSaCS (2019)
Pierre Clairambault, Andrzej S. Murawski
On the Expressivity of Linear Recursion Schemes. MFCS (2019)
Simon Castellan, Pierre Clairambault, Peter Dybjer
Categories with Families: Unityped, Simply Typed, and Dependently Typed. CoRR (2019)
Simon Castellan, Pierre Clairambault, Glynn Winskel
Thin Games with Symmetry and Concurrent Hyland-Ong Games. Log. Methods Comput. Sci. 15 (1) (2019)
Pierre Clairambault, Hugo Paquet
Fully Abstract Models of the Probabilistic lambda-calculus. CSL (2018)
Simon Castellan, Pierre Clairambault, Hugo Paquet, Glynn Winskel
The concurrent game semantics of Probabilistic PCF. LICS (2018)
Pierre Clairambault, Charles Grellois, Andrzej S. Murawski
Linearity in higher-order recursion schemes. Proc. ACM Program. Lang. 2 (POPL) (2018)
Aurore Alcolei, Pierre Clairambault, Martin Hyland, Glynn Winskel
The True Concurrency of Herbrand's Theorem. CSL (2018)
Simon Castellan, Pierre Clairambault, Jonathan Hayman, Glynn Winskel
Non-angelic Concurrent Game Semantics. FoSSaCS (2018)
Simon Castellan, Pierre Clairambault, Glynn Winskel
Distributed Strategies Made Easy. MFCS (2017)
Simon Castellan, Pierre Clairambault, Silvain Rideau, Glynn Winskel
Games and Strategies as Event Structures. Log. Methods Comput. Sci. 13 (3) (2017)
Simon Castellan, Pierre Clairambault, Glynn Winskel
Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or. FSCD (2017)
Simon Castellan, Pierre Clairambault, Peter Dybjer
Undecidability of Equality in the Free Locally Cartesian Closed Category (Extended version). Log. Methods Comput. Sci. 13 (4) (2017)
Simon Castellan, Pierre Clairambault
Causality vs. Interleavings in Concurrent Game Semantics. CONCUR (2016)
Simon Castellan, Pierre Clairambault, Silvain Rideau, Glynn Winskel
Concurrent Games. CoRR (2016)
Pierre Clairambault, Peter Dybjer
Game Semantics and Normalization by Evaluation. FoSSaCS (2015)
Simon Castellan, Pierre Clairambault, Peter Dybjer
Undecidability of Equality in the Free Locally Cartesian Closed Category. CoRR (2015)
Pierre Clairambault
Bounding linear head reduction and visible interaction through skeletons. Log. Methods Comput. Sci. 11 (2) (2015)
Simon Castellan, Pierre Clairambault, Glynn Winskel
The Parallel Intensionally Fully Abstract Games Model of PCF. LICS (2015)
Simon Castellan, Pierre Clairambault, Peter Dybjer
Undecidability of Equality in the Free Locally Cartesian Closed Category. TLCA (2015)
Simon Castellan, Pierre Clairambault, Glynn Winskel
Concurrent Hyland-Ong games. CoRR (2014)
Pierre Clairambault, Peter Dybjer
The biequivalence of locally cartesian closed categories and Martin-Löf type theories. Math. Struct. Comput. Sci. 24 (6) (2014)
Simon Castellan, Pierre Clairambault, Glynn Winskel
Symmetry in concurrent games. CSL-LICS (2014)
Pierre Clairambault
Bounding Skeletons, Locally Scoped Terms and Exact Bounds for Linear Head Reduction. TLCA (2013)
Pierre Clairambault, Glynn Winskel
On Concurrent Games with Payoff. MFPS (2013)
Pierre Clairambault
Strong functors and interleaving fixpoints in game semantics. RAIRO Theor. Informatics Appl. 47 (1) (2013)
Pierre Clairambault, Andrzej S. Murawski
Böhm Trees as Higher-Order Recursive Schemes. FSTTCS (2013)
Pierre Clairambault, Julian Gutierrez, Glynn Winskel
Imperfect Information in Logic and Concurrent Games. Computation, Logic, Games, and Quantum Foundations (2013)
Pierre Clairambault, Julian Gutierrez, Glynn Winskel
The Winning Ways of Concurrent Games. LICS (2012)
Pierre Clairambault
Isomorphisms of types in the presence of higher-order references (extended version) Log. Methods Comput. Sci. 8 (3) (2012)
Pierre Clairambault
Estimation of the length of interactions in arena game semantics CoRR (2011)
Pierre Clairambault
Isomorphisms of types in the presence of higher-order references CoRR (2011)
Pierre Clairambault, Peter Dybjer
The Biequivalence of Locally Cartesian Closed Categories and Martin-Löf Type Theories. TLCA (2011)
Pierre Clairambault
Isomorphisms of Types in the Presence of Higher-Order References. LICS (2011)
Pierre Clairambault
Estimation of the Length of Interactions in Arena Game Semantics. FoSSaCS (2011)
Pierre Clairambault, Peter Dybjer
The Biequivalence of Locally Cartesian Closed Categories and Martin-Löf Type Theories CoRR (2011)
Pierre Clairambault
Least and greatest fixpoints in game semantics CoRR (2010)
Pierre Clairambault, Russ Harmer
Totality in arena games. Ann. Pure Appl. Log. 161 (5) (2010)
Pierre Clairambault
Least and Greatest Fixpoints in Game Semantics. FICS (2009)
Pierre Clairambault
Least and Greatest Fixpoints in Game Semantics. FoSSaCS (2009)

Pierre Clairambault.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Pierre Clairambault