default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Clairambault
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b2]Pierre Clairambault:
Causal Investigations in Interactive Semantics. Aix-Marseille University, France, 2024- [j13]Simon Castellan, Pierre Clairambault:
Disentangling Parallelism and Interference in Game Semantics. Log. Methods Comput. Sci. 20(3) (2024) - [c29]Pierre Clairambault
, Simon Forest:
An Analysis of Symmetry in Quantitative Semantics. LICS 2024: 26:1-26:13 - [i18]Pierre Clairambault, Simon Forest:
An Analysis of Symmetry in Quantitative Semantics. CoRR abs/2401.17483 (2024) - 2023
- [j12]Simon Castellan, Pierre Clairambault:
The Geometry of Causality: Multi-token Geometry of Interaction and Its Causal Unfolding. Proc. ACM Program. Lang. 7(POPL): 689-717 (2023) - [c28]Lison Blondeau-Patissier, Pierre Clairambault, Lionel Vaux Auclair:
Strategies as Resource Terms, and Their Categorical Semantics. FSCD 2023: 13:1-13:22 - [c27]Pierre Clairambault, Simon Forest:
The Cartesian Closed Bicategory of Thin Spans of Groupoids. LICS 2023: 1-13 - [c26]Pierre Clairambault, Federico Olimpieri, Hugo Paquet:
From Thin Concurrent Games to Generalized Species of Structures. LICS 2023: 1-14 - [i17]Pierre Clairambault, Simon Forest:
The Cartesian Closed Bicategory of Thin Spans of Groupoids. CoRR abs/2301.11860 (2023) - [i16]Pierre Clairambault, Federico Olimpieri, Hugo Paquet:
From Thin Concurrent Games to Generalized Species of Structures. CoRR abs/2302.01082 (2023) - [i15]Lison Blondeau-Patissier, Pierre Clairambault, Lionel Vaux Auclair:
Strategies as Resource Terms, and their Categorical Semantics. CoRR abs/2302.04685 (2023) - [i14]Lison Blondeau-Patissier, Pierre Clairambault, Lionel Vaux Auclair:
Extensional Taylor Expansion. CoRR abs/2305.08489 (2023) - 2021
- [c25]Lison Blondeau-Patissier, Pierre Clairambault:
Positional Injectivity for Innocent Strategies. FSCD 2021: 17:1-17:22 - [i13]Simon Castellan, Pierre Clairambault:
Disentangling Parallelism and Interference in Game Semantics. CoRR abs/2103.15453 (2021) - [i12]Lison Blondeau-Patissier, Pierre Clairambault:
Positional Injectivity for Innocent Strategies. CoRR abs/2105.02485 (2021) - [i11]Pierre Clairambault, Hugo Paquet:
The Quantitative Collapse of Concurrent Games with Symmetry. CoRR abs/2107.03155 (2021) - [i10]Simon Castellan, Pierre Clairambault, Glynn Winskel:
The Mays and Musts of Concurrent Strategies. CoRR abs/2108.10558 (2021) - 2020
- [j11]Pierre Clairambault, Marc de Visme:
Full abstraction for the quantum lambda-calculus. Proc. ACM Program. Lang. 4(POPL): 63:1-63:28 (2020) - [i9]Pierre Clairambault:
Learning to Count up to Symmetry. CoRR abs/2006.05080 (2020)
2010 – 2019
- 2019
- [j10]Simon Castellan, Pierre Clairambault, Glynn Winskel:
Thin Games with Symmetry and Concurrent Hyland-Ong Games. Log. Methods Comput. Sci. 15(1) (2019) - [j9]Pierre Clairambault, Marc de Visme, Glynn Winskel:
Game semantics for quantum programming. Proc. ACM Program. Lang. 3(POPL): 32:1-32:29 (2019) - [c24]Aurore Alcolei, Pierre Clairambault, Olivier Laurent:
Resource-Tracking Concurrent Games. FoSSaCS 2019: 27-44 - [c23]Pierre Clairambault, Andrzej S. Murawski:
On the Expressivity of Linear Recursion Schemes. MFCS 2019: 50:1-50:14 - [c22]Pierre Clairambault, Marc de Visme, Glynn Winskel:
Concurrent Quantum Strategies. RC 2019: 3-19 - [i8]Simon Castellan, Pierre Clairambault, Peter Dybjer:
Categories with Families: Unityped, Simply Typed, and Dependently Typed. CoRR abs/1904.00827 (2019) - 2018
- [j8]Pierre Clairambault, Charles Grellois, Andrzej S. Murawski:
Linearity in higher-order recursion schemes. Proc. ACM Program. Lang. 2(POPL): 39:1-39:29 (2018) - [c21]Aurore Alcolei, Pierre Clairambault, Martin Hyland, Glynn Winskel:
The True Concurrency of Herbrand's Theorem. CSL 2018: 5:1-5:22 - [c20]Pierre Clairambault, Hugo Paquet:
Fully Abstract Models of the Probabilistic lambda-calculus. CSL 2018: 16:1-16:17 - [c19]Simon Castellan, Pierre Clairambault, Jonathan Hayman, Glynn Winskel:
Non-angelic Concurrent Game Semantics. FoSSaCS 2018: 3-19 - [c18]Simon Castellan, Pierre Clairambault, Hugo Paquet, Glynn Winskel:
The concurrent game semantics of Probabilistic PCF. LICS 2018: 215-224 - 2017
- [j7]Simon Castellan, Pierre Clairambault, Silvain Rideau, Glynn Winskel:
Games and Strategies as Event Structures. Log. Methods Comput. Sci. 13(3) (2017) - [j6]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) - [c17]Simon Castellan, Pierre Clairambault, Glynn Winskel:
Distributed Strategies Made Easy. MFCS 2017: 81:1-81:13 - [c16]Simon Castellan, Pierre Clairambault, Glynn Winskel:
Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or. FSCD 2017: 12:1-12:16 - 2016
- [c15]Simon Castellan, Pierre Clairambault:
Causality vs. Interleavings in Concurrent Game Semantics. CONCUR 2016: 32:1-32:14 - [i7]Simon Castellan, Pierre Clairambault, Silvain Rideau, Glynn Winskel:
Concurrent Games. CoRR abs/1604.04390 (2016) - 2015
- [j5]Pierre Clairambault:
Bounding linear head reduction and visible interaction through skeletons. Log. Methods Comput. Sci. 11(2) (2015) - [c14]Pierre Clairambault, Peter Dybjer:
Game Semantics and Normalization by Evaluation. FoSSaCS 2015: 56-70 - [c13]Simon Castellan, Pierre Clairambault, Glynn Winskel:
The Parallel Intensionally Fully Abstract Games Model of PCF. LICS 2015: 232-243 - [c12]Simon Castellan, Pierre Clairambault, Peter Dybjer:
Undecidability of Equality in the Free Locally Cartesian Closed Category. TLCA 2015: 138-152 - [i6]Simon Castellan, Pierre Clairambault, Peter Dybjer:
Undecidability of Equality in the Free Locally Cartesian Closed Category. CoRR abs/1504.03995 (2015) - 2014
- [j4]Pierre Clairambault, Peter Dybjer:
The biequivalence of locally cartesian closed categories and Martin-Löf type theories. Math. Struct. Comput. Sci. 24(6) (2014) - [c11]Simon Castellan, Pierre Clairambault, Glynn Winskel:
Symmetry in concurrent games. CSL-LICS 2014: 28:1-28:10 - [i5]Simon Castellan, Pierre Clairambault, Glynn Winskel:
Concurrent Hyland-Ong games. CoRR abs/1409.7542 (2014) - 2013
- [j3]Pierre Clairambault:
Strong functors and interleaving fixpoints in game semantics. RAIRO Theor. Informatics Appl. 47(1): 25-68 (2013) - [c10]Pierre Clairambault, Julian Gutierrez, Glynn Winskel:
Imperfect Information in Logic and Concurrent Games. Computation, Logic, Games, and Quantum Foundations 2013: 7-20 - [c9]Pierre Clairambault, Andrzej S. Murawski:
Böhm Trees as Higher-Order Recursive Schemes. FSTTCS 2013: 91-102 - [c8]Pierre Clairambault:
Bounding Skeletons, Locally Scoped Terms and Exact Bounds for Linear Head Reduction. TLCA 2013: 109-124 - [c7]Pierre Clairambault, Glynn Winskel:
On Concurrent Games with Payoff. MFPS 2013: 71-92 - 2012
- [j2]Pierre Clairambault:
Isomorphisms of types in the presence of higher-order references (extended version). Log. Methods Comput. Sci. 8(3) (2012) - [c6]Pierre Clairambault, Julian Gutierrez, Glynn Winskel:
The Winning Ways of Concurrent Games. LICS 2012: 235-244 - 2011
- [c5]Pierre Clairambault:
Estimation of the Length of Interactions in Arena Game Semantics. FoSSaCS 2011: 335-349 - [c4]Pierre Clairambault:
Isomorphisms of Types in the Presence of Higher-Order References. LICS 2011: 152-161 - [c3]Pierre Clairambault, Peter Dybjer:
The Biequivalence of Locally Cartesian Closed Categories and Martin-Löf Type Theories. TLCA 2011: 91-106 - [i4]Pierre Clairambault:
Estimation of the length of interactions in arena game semantics. CoRR abs/1112.3053 (2011) - [i3]Pierre Clairambault:
Isomorphisms of types in the presence of higher-order references. CoRR abs/1112.3198 (2011) - [i2]Pierre Clairambault, Peter Dybjer:
The Biequivalence of Locally Cartesian Closed Categories and Martin-Löf Type Theories. CoRR abs/1112.3456 (2011) - 2010
- [b1]Pierre Clairambault:
Logique et Interaction : une Étude Sémantique de la Totalité. (Logic and Interaction : a Semantic Study of Totality). Paris Diderot University, France, 2010 - [j1]Pierre Clairambault, Russ Harmer:
Totality in arena games. Ann. Pure Appl. Log. 161(5): 673-689 (2010) - [i1]Pierre Clairambault:
Least and greatest fixpoints in game semantics. CoRR abs/1001.0641 (2010)
2000 – 2009
- 2009
- [c2]Pierre Clairambault:
Least and Greatest Fixpoints in Game Semantics. FICS 2009: 39-45 - [c1]Pierre Clairambault:
Least and Greatest Fixpoints in Game Semantics. FoSSaCS 2009: 16-31
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 21:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
