default search action
Patrick Baillot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c24]Patrick Baillot
, Ugo Dal Lago
On Basic Feasible Functionals and the Interpretation Method. FoSSaCS (2) 2024: 70-91 - [c23]Victor Sannier
A Linear Type System for L^p-Metric Sensitivity Analysis. FSCD 2024: 12:1-12:22 - [i15]Patrick Baillot, Ugo Dal Lago, Cynthia Kop, Deivid Vale:
On Basic Feasible Functionals and the Interpretation Method. CoRR abs/2401.12385 (2024) - 2023
- [c22]june wunder
Bunched Fuzz: Sensitivity for Vector Metrics. ESOP 2023: 451-478 - 2022
- [j16]Patrick Baillot, Alexis Ghyselen
Types for Complexity of Parallel Computation in Pi-calculus. ACM Trans. Program. Lang. Syst. 44(3): 15:1-15:50 (2022) - [i14]june wunder, Arthur Azevedo de Amorim, Patrick Baillot, Marco Gaboardi:
Bunched Fuzz: Sensitivity for Vector Metrics. CoRR abs/2202.01901 (2022) - 2021
- [c21]Patrick Baillot, Alexis Ghyselen
Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes. CONCUR 2021: 34:1-34:22 - [c20]Patrick Baillot, Alexis Ghyselen
Types for Complexity of Parallel Computation in Pi-Calculus. ESOP 2021: 59-86 - [i13]Patrick Baillot, Alexis Ghyselen, Naoki Kobayashi:
Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes. CoRR abs/2104.07293 (2021) - 2020
- [j15]Patrick Baillot, Alexis Ghyselen
Combining linear logic and size types for implicit complexity. Theor. Comput. Sci. 813: 70-99 (2020)
2010 – 2019
- 2019
- [j14]Patrick Baillot, Gilles Barthe, Ugo Dal Lago
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs. J. Autom. Reason. 63(4): 813-855 (2019) - [i12]Patrick Baillot, Alexis Ghyselen:
Types for Parallel Complexity in the Pi-calculus. CoRR abs/1910.02145 (2019) - 2018
- [j13]Patrick Baillot, Erika De Benedetti, Simona Ronchi Della Rocca:
Characterizing polynomial and exponential complexity classes in elementary lambda-calculus. Inf. Comput. 261: 55-77 (2018) - [c19]Patrick Baillot, Alexis Ghyselen
Combining Linear Logic and Size Types for Implicit Complexity. CSL 2018: 9:1-9:21 - 2016
- [j12]Patrick Baillot, Ugo Dal Lago
Higher-order interpretations and program complexity. Inf. Comput. 248: 56-81 (2016) - [c18]Patrick Baillot, Anupam Das
Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic. CSL 2016: 40:1-40:18 - 2015
- [j11]Patrick Baillot:
On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy. Inf. Comput. 241: 3-31 (2015) - [c17]Patrick Baillot, Gilles Barthe, Ugo Dal Lago
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs. LPAR 2015: 203-218 - 2014
- [c16]Patrick Baillot, Erika De Benedetti, Simona Ronchi Della Rocca:
Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus. IFIP TCS 2014: 151-163 - 2012
- [j10]Patrick Baillot, Ugo Dal Lago
On quasi-interpretations, blind abstractions and implicit complexity. Math. Struct. Comput. Sci. 22(4): 549-580 (2012) - [c15]Patrick Baillot, Ugo Dal Lago
Higher-Order Interpretations and Program Complexity. CSL 2012: 62-76 - 2011
- [j9]Patrick Baillot, Paolo Coppola, Ugo Dal Lago
Light logics and optimal reduction: Completeness and complexity. Inf. Comput. 209(2): 118-142 (2011) - [c14]Patrick Baillot:
Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy. APLAS 2011: 337-352 - 2010
- [j8]Patrick Baillot, Damiano Mazza:
Linear logic by levels and bounded time complexity. Theor. Comput. Sci. 411(2): 470-503 (2010) - [c13]Patrick Baillot, Marco Gaboardi, Virgile Mogbil:
A PolyTime Functional Language from Light Linear Logic. ESOP 2010: 104-124 - [c12]Patrick Baillot, Martin Hofmann:
Type inference in intuitionistic linear logic. PPDP 2010: 219-230 - [e1]Patrick Baillot:
Proceedings International Workshop on Developments in Implicit Computational complExity, DICE 2010, Paphos, Cyprus, 27-28th March 2010. EPTCS 23, 2010 [contents] - [i11]Roberto M. Amadio, Patrick Baillot, Antoine Madet:
An affine-intuitionistic system of types and effects: confluence and termination. CoRR abs/1005.0835 (2010)
2000 – 2009
- 2009
- [j7]Patrick Baillot, Kazushige Terui:
Light types for polynomial time computation in lambda calculus. Inf. Comput. 207(1): 41-62 (2009) - [j6]Patrick Baillot, Jean-Yves Marion, Simona Ronchi Della Rocca:
Guest editorial: Special issue on implicit computational complexity. ACM Trans. Comput. Log. 10(4): 23:1-23:2 (2009) - [i10]Roberto M. Amadio, Patrick Baillot, Antoine Madet:
An affine-intuitionistic system of types and effects: confluence and termination. CoRR abs/0912.0419 (2009) - 2008
- [i9]Patrick Baillot, Damiano Mazza:
Linear Logic by Levels and Bounded Time Complexity. CoRR abs/0801.1253 (2008) - 2007
- [j5]Vincent Atassi, Patrick Baillot, Kazushige Terui:
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic. Log. Methods Comput. Sci. 3(4) (2007) - [c11]Patrick Baillot, Paolo Coppola, Ugo Dal Lago
Light Logics and Optimal Reduction: Completeness and Complexity. LICS 2007: 421-430 - [c10]Patrick Baillot:
From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing. TLCA 2007: 2-7 - [i8]Patrick Baillot, Paolo Coppola, Ugo Dal Lago:
Light Logics and Optimal Reduction: Completeness and Complexity. CoRR abs/0704.2448 (2007) - [i7]Vincent Atassi, Patrick Baillot, Kazushige Terui:
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic. CoRR abs/0710.1153 (2007) - 2006
- [j4]Ugo Dal Lago
On light logics, uniform encodings and polynomial time. Math. Struct. Comput. Sci. 16(4): 713-733 (2006) - [c9]Vincent Atassi, Patrick Baillot, Kazushige Terui:
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic. CSL 2006: 150-166 - [i6]Vincent Atassi, Patrick Baillot, Kazushige Terui:
Verification of Ptime reducibility for system F terms via Dual Light Affine Logic. CoRR abs/cs/0603104 (2006) - [i5]Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen:
On Quasi-Interpretations, Blind Abstractions and Implicit Complexity. CoRR abs/cs/0608030 (2006) - [i4]Patrick Baillot, Marco Pedicini:
An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus. CoRR abs/cs/0608040 (2006) - 2005
- [c8]Patrick Baillot, Kazushige Terui:
A Feasible Algorithm for Typing in Elementary Affine Logic. TLCA 2005: 55-70 - 2004
- [j3]Patrick Baillot:
Stratified coherence spaces: a denotational semantics for light linear logic. Theor. Comput. Sci. 318(1-2): 29-55 (2004) - [j2]Patrick Baillot:
Type inference for light affine logic via constraints on words. Theor. Comput. Sci. 328(3): 289-323 (2004) - [c7]Alexandru Suna, Amal El Fallah Seghrouchni, Christophe Fouqueré, Patrick Baillot:
Mobile Multi-Agent Systems: A Programming Language and Its Semantics. AAMAS 2004: 1386-1387 - [c6]Patrick Baillot, Virgile Mogbil:
Soft lambda-Calculus: A Language for Polynomial Time Computation. FoSSaCS 2004: 27-41 - [c5]Patrick Baillot, Kazushige Terui:
Light Types for Polynomial Time Computation in Lambda-Calculus. LICS 2004: 266-275 - [i3]Patrick Baillot, Kazushige Terui:
A feasible algorithm for typing in Elementary Affine Logic. CoRR abs/cs/0412028 (2004) - [i2]Patrick Baillot, Kazushige Terui:
Light types for polynomial time computation in lambda-calculus. CoRR cs.LO/0402059 (2004) - 2003
- [i1]Patrick Baillot, Virgile Mogbil:
Soft lambda-calculus: a language for polynomial time computation. CoRR cs.LO/0312015 (2003) - 2002
- [c4]Patrick Baillot:
Checking Polynomial Time Complexity with Types. IFIP TCS 2002: 370-382 - 2001
- [j1]Patrick Baillot, Marco Pedicini:
Elementary Complexity and Geometry of Interaction. Fundam. Informaticae 45(1-2): 1-31 (2001)
1990 – 1999
- 1999
- [c3]Patrick Baillot, Marco Pedicini
Elementary Complexity and Geometry of Interaction. TLCA 1999: 25-39 - 1997
- [c2]Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Regnier:
Timeless Games. CSL 1997: 56-77 - [c1]Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Regnier:
Believe it or not, AJM's Games Model is a Model of Classical Linear Logic. LICS 1997: 68-75
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-07 21:23 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: