Travelled to:1 × Austria
1 × Canada
1 × Croatia
1 × Germany
1 × Japan
1 × Poland
1 × Serbia
1 × The Netherlands
2 × United Kingdom
Collaborated with:∅ G.Winskel P.Dybjer S.Castellan M.d.Visme H.Paquet J.Gutierrez C.Grellois A.S.Murawski A.Alcolei M.Hyland
Talks about:game (7) semant (4) abstract (3) concurr (3) local (3) cartesian (2) categori (2) calculus (2) quantum (2) linear (2)
Person: Pierre Clairambault
DBLP: Clairambault:Pierre
Contributed to:
2015
2015
20152014201320122011201120112009
2018
201820192020Wrote 15 papers:
- FoSSaCS-2015-ClairambaultD #evaluation #game studies #normalisation #semantics
- Game Semantics and Normalization by Evaluation (PC, PD), pp. 56–70.
- LICS-2015-CastellanCW #game studies #parallel
- The Parallel Intensionally Fully Abstract Games Model of PCF (SC, PC, GW), pp. 232–243.
- TLCA-2015-CastellanCD #similarity
- Undecidability of Equality in the Free Locally Cartesian Closed Category (SC, PC, PD), pp. 138–152.
- LICS-CSL-2014-CastellanCW #concurrent #game studies #symmetry
- Symmetry in concurrent games (SC, PC, GW), p. 10.
- TLCA-2013-Clairambault #bound #linear #reduction
- Bounding Skeletons, Locally Scoped Terms and Exact Bounds for Linear Head Reduction (PC), pp. 109–124.
- LICS-2012-ClairambaultGW #concurrent #game studies
- The Winning Ways of Concurrent Games (PC, JG, GW), pp. 235–244.
- FoSSaCS-2011-Clairambault #estimation #game studies #interactive #semantics
- Estimation of the Length of Interactions in Arena Game Semantics (PC), pp. 335–349.
- LICS-2011-Clairambault #higher-order #morphism
- Isomorphisms of Types in the Presence of Higher-Order References (PC), pp. 152–161.
- TLCA-2011-ClairambaultD #category theory
- The Biequivalence of Locally Cartesian Closed Categories and Martin-Löf Type Theories (PC, PD), pp. 91–106.
- FoSSaCS-2009-Clairambault #fixpoint #game studies #semantics
- Least and Greatest Fixpoints in Game Semantics (PC), pp. 16–31.
- CSL-2018-AlcoleiCHW #concurrent #theorem
- The True Concurrency of Herbrand's Theorem (AA, PC, MH, GW), p. 22.
- CSL-2018-ClairambaultP #modelling #probability #λ-calculus
- Fully Abstract Models of the Probabilistic lambda-calculus (PC, HP), p. 17.
- POPL-2018-ClairambaultGM #higher-order #recursion
- Linearity in higher-order recursion schemes (PC, CG, ASM), p. 29.
- POPL-2019-ClairambaultVW #game studies #programming #quantum #semantics
- Game semantics for quantum programming (PC, MdV, GW), p. 29.
- POPL-2020-ClairambaultV #abstraction #quantum #λ-calculus
- Full abstraction for the quantum lambda-calculus (PC, MdV), p. 28.