Patrick Baillot

61 papers A* 3A 5B 12C 1Journal 33Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
Dependent Coeffects for Local Sensitivity Analysis.
Proc. ACM Program. Lang.
Victor Sannier, Patrick Baillot
2025 J jnl
A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations.
Log. Methods Comput. Sci.
Patrick Baillot, Ugo Dal Lago, Cynthia Kop, Deivid Vale
2025 B conf
A Kleene Algebra with Tests for Union Bound Reasoning About Probabilistic Programs.
CSL
Leandro Gomes, Patrick Baillot, Marco Gaboardi
2025 B conf
BiGKAT: An Algebraic Framework for Relational Verification of Probabilistic Programs.
FoSSaCS
Leandro Gomes, Patrick Baillot, Marco Gaboardi
2025 A conf
Session Types for the Concurrent Composition of Interactive Differential Privacy.
CSF
Victor Sannier, Patrick Baillot, Marco Gaboardi
2024 B conf
A Linear Type System for L^p-Metric Sensitivity Analysis.
FSCD
Victor Sannier, Patrick Baillot
2024 — conf
On Basic Feasible Functionals and the Interpretation Method.
FoSSaCS (2)
Patrick Baillot, Ugo Dal Lago, Cynthia Kop, Deivid Vale
2024 J jnl
On Basic Feasible Functionals and the Interpretation Method.
CoRR
Patrick Baillot, Ugo Dal Lago, Cynthia Kop, Deivid Vale
2023 A conf
Bunched Fuzz: Sensitivity for Vector Metrics.
ESOP
june wunder, Arthur Azevedo de Amorim, Patrick Baillot, Marco Gaboardi
2022 J jnl
Bunched Fuzz: Sensitivity for Vector Metrics.
CoRR
june wunder, Arthur Azevedo de Amorim, Patrick Baillot, Marco Gaboardi
2022 J jnl
Types for Complexity of Parallel Computation in Pi-calculus.
ACM Trans. Program. Lang. Syst.
Patrick Baillot, Alexis Ghyselen
2021 B conf
Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes.
CONCUR
Patrick Baillot, Alexis Ghyselen, Naoki Kobayashi
2021 J jnl
Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes.
CoRR
Patrick Baillot, Alexis Ghyselen, Naoki Kobayashi
2021 A conf
Types for Complexity of Parallel Computation in Pi-Calculus.
ESOP
Patrick Baillot, Alexis Ghyselen
2020 J jnl
Combining linear logic and size types for implicit complexity.
Theor. Comput. Sci.
Patrick Baillot, Alexis Ghyselen
2019 J jnl
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs.
J. Autom. Reason.
Patrick Baillot, Gilles Barthe, Ugo Dal Lago
2019 J jnl
Types for Parallel Complexity in the Pi-calculus.
CoRR
Patrick Baillot, Alexis Ghyselen
2018 J jnl
Characterizing polynomial and exponential complexity classes in elementary lambda-calculus.
Inf. Comput.
Patrick Baillot, Erika De Benedetti, Simona Ronchi Della Rocca
2018 B conf
Combining Linear Logic and Size Types for Implicit Complexity.
CSL
Patrick Baillot, Alexis Ghyselen
2016 B conf
Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic.
CSL
Patrick Baillot, Anupam Das
2016 J jnl
Higher-order interpretations and program complexity.
Inf. Comput.
Patrick Baillot, Ugo Dal Lago
2015 B conf
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs.
LPAR
Patrick Baillot, Gilles Barthe, Ugo Dal Lago
2015 J jnl
On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy.
Inf. Comput.
Patrick Baillot
2014 — conf
Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus.
IFIP TCS
Patrick Baillot, Erika De Benedetti, Simona Ronchi Della Rocca
2012 B conf
Higher-Order Interpretations and Program Complexity.
CSL
Patrick Baillot, Ugo Dal Lago
2012 J jnl
On quasi-interpretations, blind abstractions and implicit complexity.
Math. Struct. Comput. Sci.
Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen
2011 B conf
Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy.
APLAS
Patrick Baillot
2011 J jnl
Light logics and optimal reduction: Completeness and complexity.
Inf. Comput.
Patrick Baillot, Paolo Coppola, Ugo Dal Lago
2010 A conf
A PolyTime Functional Language from Light Linear Logic.
ESOP
Patrick Baillot, Marco Gaboardi, Virgile Mogbil
2010 J jnl
An affine-intuitionistic system of types and effects: confluence and termination
CoRR
Roberto M. Amadio, Patrick Baillot, Antoine Madet
2010 J jnl
Linear logic by levels and bounded time complexity.
Theor. Comput. Sci.
Patrick Baillot, Damiano Mazza
2010 — ed.
Proceedings International Workshop on Developments in Implicit Computational complExity, DICE 2010, Paphos, Cyprus, 27-28th March 2010.
DICE
Patrick Baillot
2010 C conf
Type inference in intuitionistic linear logic.
PPDP
Patrick Baillot, Martin Hofmann
2009 J jnl
An affine-intuitionistic system of types and effects: confluence and termination
CoRR
Roberto M. Amadio, Patrick Baillot, Antoine Madet
2009 J jnl
Guest editorial: Special issue on implicit computational complexity.
ACM Trans. Comput. Log.
Patrick Baillot, Jean-Yves Marion, Simona Ronchi Della Rocca
2009 J jnl
Light types for polynomial time computation in lambda calculus.
Inf. Comput.
Patrick Baillot, Kazushige Terui
2008 J jnl
Linear Logic by Levels and Bounded Time Complexity
CoRR
Patrick Baillot, Damiano Mazza
2007 — conf
From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing.
TLCA
Patrick Baillot
2007 J jnl
Light Logics and Optimal Reduction: Completeness and Complexity
CoRR
Patrick Baillot, Paolo Coppola, Ugo Dal Lago
2007 A* conf
Light Logics and Optimal Reduction: Completeness and Complexity.
LICS
Patrick Baillot, Paolo Coppola, Ugo Dal Lago
2007 J jnl
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
CoRR
Vincent Atassi, Patrick Baillot, Kazushige Terui
2007 J jnl
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic.
Log. Methods Comput. Sci.
Vincent Atassi, Patrick Baillot, Kazushige Terui
2006 J jnl
An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus
CoRR
Patrick Baillot, Marco Pedicini
2006 J jnl
On Quasi-Interpretations, Blind Abstractions and Implicit Complexity
CoRR
Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen
2006 J jnl
On light logics, uniform encodings and polynomial time.
Math. Struct. Comput. Sci.
Ugo Dal Lago, Patrick Baillot
2006 B conf
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic.
CSL
Vincent Atassi, Patrick Baillot, Kazushige Terui
2006 J jnl
Verification of Ptime reducibility for system F terms via Dual Light Affine Logic
CoRR
Vincent Atassi, Patrick Baillot, Kazushige Terui
2005 — conf
A Feasible Algorithm for Typing in Elementary Affine Logic.
TLCA
Patrick Baillot, Kazushige Terui
2004 J jnl
A feasible algorithm for typing in Elementary Affine Logic
CoRR
Patrick Baillot, Kazushige Terui
2004 A* conf
Light Types for Polynomial Time Computation in Lambda-Calculus.
LICS
Patrick Baillot, Kazushige Terui
2004 J jnl
Light types for polynomial time computation in lambda-calculus
CoRR
Patrick Baillot, Kazushige Terui
2004 A conf
Mobile Multi-Agent Systems: A Programming Language and Its Semantics.
AAMAS
Alexandru Suna, Amal El Fallah Seghrouchni, Christophe Fouqueré, Patrick Baillot
2004 B conf
Soft lambda-Calculus: A Language for Polynomial Time Computation.
FoSSaCS
Patrick Baillot, Virgile Mogbil
2004 J jnl
Stratified coherence spaces: a denotational semantics for light linear logic.
Theor. Comput. Sci.
Patrick Baillot
2004 J jnl
Type inference for light affine logic via constraints on words.
Theor. Comput. Sci.
Patrick Baillot
2003 J jnl
Soft lambda-calculus: a language for polynomial time computation
CoRR
Patrick Baillot, Virgile Mogbil
2002 — conf
Checking Polynomial Time Complexity with Types.
IFIP TCS
Patrick Baillot
2001 J jnl
Elementary Complexity and Geometry of Interaction.
Fundam. Informaticae
Patrick Baillot, Marco Pedicini
1999 — conf
Elementary Complexity and Geometry of Interaction.
TLCA
Patrick Baillot, Marco Pedicini
1997 A* conf
Believe it or not, AJM's Games Model is a Model of Classical Linear Logic.
LICS
Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Regnier
1997 B conf
Timeless Games.
CSL
Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Regnier