Patrick Baillot

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 16

Top Topics

Cut Elimination

Parallel Computation

Sensitivity Analysis

Computational Complexity

Top Venues

Publications

Patrick Baillot, Ugo Dal Lago, Cynthia Kop, Deivid Vale
On Basic Feasible Functionals and the Interpretation Method. FoSSaCS (2) (2024)
Victor Sannier, Patrick Baillot
A Linear Type System for L^p-Metric Sensitivity Analysis. FSCD (2024)
Patrick Baillot, Ugo Dal Lago, Cynthia Kop, Deivid Vale
On Basic Feasible Functionals and the Interpretation Method. CoRR (2024)
june wunder, Arthur Azevedo de Amorim, Patrick Baillot, Marco Gaboardi
Bunched Fuzz: Sensitivity for Vector Metrics. ESOP (2023)
Patrick Baillot, Alexis Ghyselen
Types for Complexity of Parallel Computation in Pi-calculus. ACM Trans. Program. Lang. Syst. 44 (3) (2022)
june wunder, Arthur Azevedo de Amorim, Patrick Baillot, Marco Gaboardi
Bunched Fuzz: Sensitivity for Vector Metrics. CoRR (2022)
Patrick Baillot, Alexis Ghyselen
Types for Complexity of Parallel Computation in Pi-Calculus. ESOP (2021)
Patrick Baillot, Alexis Ghyselen, Naoki Kobayashi
Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes. CONCUR (2021)
Patrick Baillot, Alexis Ghyselen, Naoki Kobayashi
Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes. CoRR (2021)
Patrick Baillot, Alexis Ghyselen
Combining linear logic and size types for implicit complexity. Theor. Comput. Sci. 813 (2020)
Patrick Baillot, Alexis Ghyselen
Types for Parallel Complexity in the Pi-calculus. CoRR (2019)
Patrick Baillot, Gilles Barthe, Ugo Dal Lago
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs. J. Autom. Reason. 63 (4) (2019)
Patrick Baillot, Alexis Ghyselen
Combining Linear Logic and Size Types for Implicit Complexity. CSL (2018)
Patrick Baillot, Erika De Benedetti, Simona Ronchi Della Rocca
Characterizing polynomial and exponential complexity classes in elementary lambda-calculus. Inf. Comput. 261 (2018)
Patrick Baillot, Anupam Das
Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic. CSL (2016)
Patrick Baillot, Ugo Dal Lago
Higher-order interpretations and program complexity. Inf. Comput. 248 (2016)
Patrick Baillot, Gilles Barthe, Ugo Dal Lago
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs. LPAR (2015)
Patrick Baillot
On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy. Inf. Comput. 241 (2015)
Patrick Baillot, Erika De Benedetti, Simona Ronchi Della Rocca
Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus. IFIP TCS (2014)
Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen
On quasi-interpretations, blind abstractions and implicit complexity. Math. Struct. Comput. Sci. 22 (4) (2012)
Patrick Baillot, Ugo Dal Lago
Higher-Order Interpretations and Program Complexity. CSL (2012)
Patrick Baillot
Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy. APLAS (2011)
Patrick Baillot, Paolo Coppola, Ugo Dal Lago
Light logics and optimal reduction: Completeness and complexity. Inf. Comput. 209 (2) (2011)
Roberto M. Amadio, Patrick Baillot, Antoine Madet
An affine-intuitionistic system of types and effects: confluence and termination CoRR (2010)
Patrick Baillot, Martin Hofmann
Type inference in intuitionistic linear logic. PPDP (2010)
Patrick Baillot, Marco Gaboardi, Virgile Mogbil
A PolyTime Functional Language from Light Linear Logic. ESOP (2010)
Patrick Baillot, Damiano Mazza
Linear logic by levels and bounded time complexity. Theor. Comput. Sci. 411 (2) (2010)
Roberto M. Amadio, Patrick Baillot, Antoine Madet
An affine-intuitionistic system of types and effects: confluence and termination CoRR (2009)
Patrick Baillot, Jean-Yves Marion, Simona Ronchi Della Rocca
Guest editorial: Special issue on implicit computational complexity. ACM Trans. Comput. Log. 10 (4) (2009)
Patrick Baillot, Kazushige Terui
Light types for polynomial time computation in lambda calculus. Inf. Comput. 207 (1) (2009)
Patrick Baillot, Damiano Mazza
Linear Logic by Levels and Bounded Time Complexity CoRR (2008)
Vincent Atassi, Patrick Baillot, Kazushige Terui
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic CoRR (2007)
Patrick Baillot, Paolo Coppola, Ugo Dal Lago
Light Logics and Optimal Reduction: Completeness and Complexity. LICS (2007)
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)
Patrick Baillot, Paolo Coppola, Ugo Dal Lago
Light Logics and Optimal Reduction: Completeness and Complexity CoRR (2007)
Patrick Baillot
From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing. TLCA (2007)
Patrick Baillot, Marco Pedicini
An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus CoRR (2006)
Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen
On Quasi-Interpretations, Blind Abstractions and Implicit Complexity CoRR (2006)
Vincent Atassi, Patrick Baillot, Kazushige Terui
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic. CSL (2006)
Ugo Dal Lago, Patrick Baillot
On light logics, uniform encodings and polynomial time. Math. Struct. Comput. Sci. 16 (4) (2006)
Vincent Atassi, Patrick Baillot, Kazushige Terui
Verification of Ptime reducibility for system F terms via Dual Light Affine Logic CoRR (2006)
Patrick Baillot, Kazushige Terui
A Feasible Algorithm for Typing in Elementary Affine Logic. TLCA (2005)
Patrick Baillot, Virgile Mogbil
Soft lambda-Calculus: A Language for Polynomial Time Computation. FoSSaCS (2004)
Alexandru Suna, Amal El Fallah Seghrouchni, Christophe Fouqueré, Patrick Baillot
Mobile Multi-Agent Systems: A Programming Language and Its Semantics. AAMAS (2004)
Patrick Baillot, Kazushige Terui
Light Types for Polynomial Time Computation in Lambda-Calculus. LICS (2004)
Patrick Baillot
Type inference for light affine logic via constraints on words. Theor. Comput. Sci. 328 (3) (2004)
Patrick Baillot, Kazushige Terui
A feasible algorithm for typing in Elementary Affine Logic CoRR (2004)
Patrick Baillot, Kazushige Terui
Light types for polynomial time computation in lambda-calculus CoRR (2004)
Patrick Baillot
Stratified coherence spaces: a denotational semantics for light linear logic. Theor. Comput. Sci. 318 (1-2) (2004)
Patrick Baillot, Virgile Mogbil
Soft lambda-calculus: a language for polynomial time computation CoRR (2003)
Patrick Baillot
Checking Polynomial Time Complexity with Types. IFIP TCS (2002)
Patrick Baillot, Marco Pedicini
Elementary Complexity and Geometry of Interaction. Fundam. Informaticae 45 (1-2) (2001)
Patrick Baillot, Marco Pedicini
Elementary Complexity and Geometry of Interaction. TLCA (1999)
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)
Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Regnier
Timeless Games. CSL (1997)