Follow
Pierre Clairambault
Pierre Clairambault
CNRS & LIS, Aix-Marseille UniversitÚ
Verified email at cnrs.fr - Homepage
Title
Cited by
Cited by
Year
The biequivalence of locally cartesian closed categories and Martin-L÷f type theories
P Clairambault, P Dybjer
Mathematical Structures in Computer Science 24 (6), e240606, 2014
902014
Games and strategies as event structures
S Castellan, P Clairambault, S Rideau, G Winskel
Logical Methods in Computer Science 13, 2017
61*2017
The parallel intensionally fully abstract games model of PCF
S Castellan, P Clairambault, G Winskel
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 232-243, 2015
422015
Symmetry in concurrent games
S Castellan, P Clairambault, G Winskel
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conferenceá…, 2014
412014
The winning ways of concurrent games
P Clairambault, J Gutierrez, G Winskel
2012 27th Annual IEEE Symposium on Logic in Computer Science, 235-244, 2012
392012
Thin Games with Symmetry and Concurrent Hyland-Ong Games
S Castellan, P Clairambault, G Winskel
Logical Methods in Computer Science, 2019
38*2019
The concurrent game semantics of probabilistic PCF
S Castellan, P Clairambault, H Paquet, G Winskel
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computerá…, 2018
382018
Game semantics for quantum programming
P Clairambault, M De Visme, G Winskel
Proceedings of the ACM on Programming Languages 3 (POPL), 1-29, 2019
322019
Categories with families: Unityped, simply typed, and dependently typed
S Castellan, P Clairambault, P Dybjer
Joachim Lambek: The Interplay of Mathematics, Logic, and Linguistics, 135-180, 2021
312021
Least and greatest fixpoints in game semantics
P Clairambault
International Conference on Foundations of Software Science andá…, 2009
312009
Totality in arena games
P Clairambault, R Harmer
Annals of pure and applied logic 161 (5), 673-689, 2010
292010
Undecidability of equality in the free locally cartesian closed category (extended version)
S Castellan, P Clairambault, P Dybjer
Logical Methods in Computer Science 13, 2017
282017
Full abstraction for the quantum lambda-calculus
P Clairambault, M De Visme
Proceedings of the ACM on Programming Languages 4 (POPL), 1-28, 2019
262019
Causality vs. interleavings in concurrent game semantics
S Castellan, P Clairambault
The 27th International Conference on Concurrency Theory (CONCUR 2016) 32, 1-3214, 2016
222016
Estimation of the length of interactions in arena game semantics
P Clairambault
Foundations of Software Science and Computational Structures: 14thá…, 2011
172011
Fully Abstract Models of the Probabilistic λ-calculus
P Clairambault, H Paquet
27th EACSL Annual Conference on Computer Science Logic (CSL 2018), 2018
162018
Non-angelic concurrent game semantics
S Castellan, P Clairambault, J Hayman, G Winskel
Foundations of Software Science and Computation Structures: 21stá…, 2018
132018
Bounding skeletons, locally scoped terms and exact bounds for linear head reduction
P Clairambault
International Conference on Typed Lambda Calculi and Applications, 109-124, 2013
13*2013
The true concurrency of Herbrand's theorem
A Alcolei, P Clairambault, M Hyland, G Winskel
27th EACSL Annual Conference on Computer Science Logic (CSL 2018), 2018
122018
On concurrent games with payoff
P Clairambault, G Winskel
Electronic Notes in Theoretical Computer Science 298, 71-92, 2013
112013
The system can't perform the operation now. Try again later.
Articles 1–20