Patrick Baillot

According to our database, Patrick Baillot authored at least 34 papers between 1997 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

On Basic Feasible Functionals and the Interpretation Method.

Patrick Baillot, Ugo Dal Lago, Cynthia Kop, Deivid Vale

Proceedings of the Foundations of Software Science and Computation Structures, 2024

2023

Bunched Fuzz: Sensitivity for Vector Metrics.

june wunder, Arthur Azevedo de Amorim, Patrick Baillot, Marco Gaboardi

Proceedings of the Programming Languages and Systems, 2023

2022

Types for Complexity of Parallel Computation in Pi-calculus.

Patrick Baillot, Alexis Ghyselen

ACM Trans. Program. Lang. Syst., 2022

2021

Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes.

Patrick Baillot, Alexis Ghyselen, Naoki Kobayashi

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020

Combining linear logic and size types for implicit complexity.

Patrick Baillot, Alexis Ghyselen

Theor. Comput. Sci., 2020

2019

Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs.

Patrick Baillot, Gilles Barthe, Ugo Dal Lago

J. Autom. Reason., 2019

Types for Parallel Complexity in the Pi-calculus.

Patrick Baillot, Alexis Ghyselen

CoRR, 2019

2018

Characterizing polynomial and exponential complexity classes in elementary lambda-calculus.

Patrick Baillot, Erika De Benedetti, Simona Ronchi Della Rocca

Inf. Comput., 2018

2016

Higher-order interpretations and program complexity.

Patrick Baillot, Ugo Dal Lago

Inf. Comput., 2016

Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic.

Patrick Baillot, Anupam Das

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015

On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy.

Patrick Baillot

Inf. Comput., 2015

2012

On quasi-interpretations, blind abstractions and implicit complexity.

Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen

Math. Struct. Comput. Sci., 2012

2011

Light logics and optimal reduction: Completeness and complexity.

Patrick Baillot, Paolo Coppola, Ugo Dal Lago

Inf. Comput., 2011

Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy.

Patrick Baillot

Proceedings of the Programming Languages and Systems - 9th Asian Symposium, 2011

2010

Linear logic by levels and bounded time complexity.

Patrick Baillot, Damiano Mazza

Theor. Comput. Sci., 2010

Type inference in intuitionistic linear logic.

Patrick Baillot, Martin Hofmann

Proceedings of the 12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2010

A PolyTime Functional Language from Light Linear Logic.

Patrick Baillot, Marco Gaboardi, Virgile Mogbil

Proceedings of the Programming Languages and Systems, 2010

2009

Guest editorial: Special issue on implicit computational complexity.

Patrick Baillot, Jean-Yves Marion, Simona Ronchi Della Rocca

ACM Trans. Comput. Log., 2009

Light types for polynomial time computation in lambda calculus.

Patrick Baillot, Kazushige Terui

Inf. Comput., 2009

An affine-intuitionistic system of types and effects: confluence and termination

Roberto M. Amadio, Patrick Baillot, Antoine Madet

CoRR, 2009

2007

Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic.

Vincent Atassi, Patrick Baillot, Kazushige Terui

Log. Methods Comput. Sci., 2007

From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing.

Patrick Baillot

Proceedings of the Typed Lambda Calculi and Applications, 8th International Conference, 2007

2006

On light logics, uniform encodings and polynomial time.

Ugo Dal Lago, Patrick Baillot

Math. Struct. Comput. Sci., 2006

An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus

Patrick Baillot, Marco Pedicini

CoRR, 2006

Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic.

Vincent Atassi, Patrick Baillot, Kazushige Terui

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005

A Feasible Algorithm for Typing in Elementary Affine Logic.

Patrick Baillot, Kazushige Terui

Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference, 2005

2004

Type inference for light affine logic via constraints on words.

Patrick Baillot

Theor. Comput. Sci., 2004

Stratified coherence spaces: a denotational semantics for light linear logic.

Patrick Baillot

Theor. Comput. Sci., 2004

Soft lambda-Calculus: A Language for Polynomial Time Computation.

Patrick Baillot, Virgile Mogbil

Proceedings of the Foundations of Software Science and Computation Structures, 2004

Mobile Multi-Agent Systems: A Programming Language and Its Semantics.

Alexandru Suna, Amal El Fallah Seghrouchni, Christophe Fouqueré, Patrick Baillot

Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

2002

Checking Polynomial Time Complexity with Types.

Patrick Baillot

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001

Elementary Complexity and Geometry of Interaction.

Patrick Baillot, Marco Pedicini

Fundam. Informaticae, 2001

1997

Believe it or not, AJM's Games Model is a Model of Classical Linear Logic.

Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Regnier

Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

Timeless Games.

Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Regnier

Proceedings of the Computer Science Logic, 11th International Workshop, 1997