Pierre Clairambault

According to our database, Pierre Clairambault authored at least 49 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Disentangling Parallelism and Interference in Game Semantics.

Simon Castellan, Pierre Clairambault

Log. Methods Comput. Sci., 2024

An Analysis of Symmetry in Quantitative Semantics.

Pierre Clairambault, Simon Forest

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Causal Investigations in Interactive Semantics.

Pierre Clairambault

, 2024

2023

The Geometry of Causality: Multi-token Geometry of Interaction and Its Causal Unfolding.

Simon Castellan, Pierre Clairambault

Proc. ACM Program. Lang., January, 2023

Extensional Taylor Expansion.

Lison Blondeau-Patissier, Pierre Clairambault, Lionel Vaux Auclair

CoRR, 2023

From Thin Concurrent Games to Generalized Species of Structures.

Pierre Clairambault, Federico Olimpieri, Hugo Paquet

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

The Cartesian Closed Bicategory of Thin Spans of Groupoids.

Pierre Clairambault, Simon Forest

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Strategies as Resource Terms, and Their Categorical Semantics.

Lison Blondeau-Patissier, Pierre Clairambault, Lionel Vaux Auclair

Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2021

The Mays and Musts of Concurrent Strategies.

Simon Castellan, Pierre Clairambault, Glynn Winskel

CoRR, 2021

The Quantitative Collapse of Concurrent Games with Symmetry.

Pierre Clairambault, Hugo Paquet

CoRR, 2021

Positional Injectivity for Innocent Strategies.

Lison Blondeau-Patissier, Pierre Clairambault

Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

2020

Full abstraction for the quantum lambda-calculus.

Pierre Clairambault, Marc de Visme

Proc. ACM Program. Lang., 2020

Learning to Count up to Symmetry.

Pierre Clairambault

CoRR, 2020

2019

Game semantics for quantum programming.

Pierre Clairambault, Marc de Visme, Glynn Winskel

Proc. ACM Program. Lang., 2019

Thin Games with Symmetry and Concurrent Hyland-Ong Games.

Simon Castellan, Pierre Clairambault, Glynn Winskel

Log. Methods Comput. Sci., 2019

Categories with Families: Unityped, Simply Typed, and Dependently Typed.

Simon Castellan, Pierre Clairambault, Peter Dybjer

CoRR, 2019

Concurrent Quantum Strategies.

Pierre Clairambault, Marc de Visme, Glynn Winskel

Proceedings of the Reversible Computation - 11th International Conference, 2019

On the Expressivity of Linear Recursion Schemes.

Pierre Clairambault, Andrzej S. Murawski

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Resource-Tracking Concurrent Games.

Aurore Alcolei, Pierre Clairambault, Olivier Laurent

Proceedings of the Foundations of Software Science and Computation Structures, 2019

2018

Linearity in higher-order recursion schemes.

Pierre Clairambault, Charles Grellois, Andrzej S. Murawski

Proc. ACM Program. Lang., 2018

The concurrent game semantics of Probabilistic PCF.

Simon Castellan, Pierre Clairambault, Hugo Paquet, Glynn Winskel

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Non-angelic Concurrent Game Semantics.

Simon Castellan, Pierre Clairambault, Jonathan Hayman, Glynn Winskel

Proceedings of the Foundations of Software Science and Computation Structures, 2018

Fully Abstract Models of the Probabilistic lambda-calculus.

Pierre Clairambault, Hugo Paquet

Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

The True Concurrency of Herbrand's Theorem.

Aurore Alcolei, Pierre Clairambault, Martin Hyland, Glynn Winskel

Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2017

Games and Strategies as Event Structures.

Simon Castellan, Pierre Clairambault, Silvain Rideau, Glynn Winskel

Log. Methods Comput. Sci., 2017

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

Simon Castellan, Pierre Clairambault, Peter Dybjer

Log. Methods Comput. Sci., 2017

Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or.

Simon Castellan, Pierre Clairambault, Glynn Winskel

Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

Distributed Strategies Made Easy.

Simon Castellan, Pierre Clairambault, Glynn Winskel

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

Concurrent Games.

Simon Castellan, Pierre Clairambault, Silvain Rideau, Glynn Winskel

CoRR, 2016

Causality vs. Interleavings in Concurrent Game Semantics.

Simon Castellan, Pierre Clairambault

Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015

Bounding linear head reduction and visible interaction through skeletons.

Pierre Clairambault

Log. Methods Comput. Sci., 2015

Undecidability of Equality in the Free Locally Cartesian Closed Category.

Simon Castellan, Pierre Clairambault, Peter Dybjer

Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

The Parallel Intensionally Fully Abstract Games Model of PCF.

Simon Castellan, Pierre Clairambault, Glynn Winskel

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Game Semantics and Normalization by Evaluation.

Pierre Clairambault, Peter Dybjer

Proceedings of the Foundations of Software Science and Computation Structures, 2015

2014

The biequivalence of locally cartesian closed categories and Martin-Löf type theories.

Pierre Clairambault, Peter Dybjer

Math. Struct. Comput. Sci., 2014

Concurrent Hyland-Ong games.

Simon Castellan, Pierre Clairambault, Glynn Winskel

CoRR, 2014

Symmetry in concurrent games.

Simon Castellan, Pierre Clairambault, Glynn Winskel

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013

Strong functors and interleaving fixpoints in game semantics.

Pierre Clairambault

RAIRO Theor. Informatics Appl., 2013

On Concurrent Games with Payoff.

Pierre Clairambault, Glynn Winskel

Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, 2013

Bounding Skeletons, Locally Scoped Terms and Exact Bounds for Linear Head Reduction.

Pierre Clairambault

Proceedings of the Typed Lambda Calculi and Applications, 11th International Conference, 2013

Böhm Trees as Higher-Order Recursive Schemes.

Pierre Clairambault, Andrzej S. Murawski

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Imperfect Information in Logic and Concurrent Games.

Pierre Clairambault, Julian Gutierrez, Glynn Winskel

Proceedings of the Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky, 2013

2012

Isomorphisms of types in the presence of higher-order references (extended version)

Pierre Clairambault

Log. Methods Comput. Sci., 2012

The Winning Ways of Concurrent Games.

Pierre Clairambault, Julian Gutierrez, Glynn Winskel

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011

Isomorphisms of Types in the Presence of Higher-Order References.

Pierre Clairambault

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Estimation of the Length of Interactions in Arena Game Semantics.

Pierre Clairambault

Proceedings of the Foundations of Software Science and Computational Structures, 2011

2010

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

Pierre Clairambault

PhD thesis, 2010

Totality in arena games.

Pierre Clairambault, Russ Harmer

Ann. Pure Appl. Log., 2010

2009

Least and Greatest Fixpoints in Game Semantics.

Pierre Clairambault

Proceedings of the Foundations of Software Science and Computational Structures, 2009