Patrick Baillot

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

A Kleene Algebra with Tests for Union Bound Reasoning About Probabilistic Programs.

[BibT_eX]

[DOI]

Leandro Gomes

Proceedings of the 33rd EACSL Annual Conference on Computer Science Logic, 2025

Session Types for the Concurrent Composition of Interactive Differential Privacy.

[BibT_eX]

[DOI]

Victor Sannier

Proceedings of the 38th IEEE Computer Security Foundations Symposium, 2025

2024

A Linear Type System for L^p-Metric Sensitivity Analysis.

[BibT_eX]

[DOI]

Victor Sannier

Proceedings of the 9th International Conference on Formal Structures for Computation and Deduction, 2024

On Basic Feasible Functionals and the Interpretation Method.

[BibT_eX]

[DOI]

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

2023

Bunched Fuzz: Sensitivity for Vector Metrics.

[BibT_eX]

[DOI]

june wunder

Arthur Azevedo de Amorim

Proceedings of the Programming Languages and Systems, 2023

2021

Types for Complexity of Parallel Computation in Pi-Calculus.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2021

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

[BibT_eX]

[DOI]

Naoki Kobayashi

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

2019

Types for Parallel Complexity in the Pi-calculus.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Combining Linear Logic and Size Types for Implicit Complexity.

[BibT_eX]

[DOI]

Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2016

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Inf. Comput., 2015

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

[BibT_eX]

[DOI]

Gilles Barthe

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015

2014

Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus.

[BibT_eX]

[DOI]

Simona Ronchi Della Rocca

Erika De Benedetti

Proceedings of the Theoretical Computer Science, 2014

2012

On quasi-interpretations, blind abstractions and implicit complexity.

[BibT_eX]

[DOI]

Jean-Yves Moyen

Math. Struct. Comput. Sci., 2012

Higher-Order Interpretations and Program Complexity.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 2012

2011

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

[BibT_eX]

[DOI]

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

2010

Linear logic by levels and bounded time complexity.

[BibT_eX]

[DOI]

Damiano Mazza

Theor. Comput. Sci., 2010

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

[BibT_eX]

[DOI]

Roberto M. Amadio

Antoine Madet

CoRR, 2010

Type inference in intuitionistic linear logic.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Virgile Mogbil

Proceedings of the Programming Languages and Systems, 2010

2009

Guest editorial: Special issue on implicit computational complexity.

[BibT_eX]

[DOI]

Simona Ronchi Della Rocca

Jean-Yves Marion

ACM Trans. Comput. Log., 2009

2007

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

[BibT_eX]

[DOI]

Vincent Atassi

Log. Methods Comput. Sci., 2007

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

[BibT_eX]

[DOI]

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

Light Logics and Optimal Reduction: Completeness and Complexity.

[BibT_eX]

[DOI]

Paolo Coppola

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

2006

On light logics, uniform encodings and polynomial time.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2006

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

[BibT_eX]

[DOI]

Marco Pedicini

CoRR, 2006

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

[BibT_eX]

[DOI]

Vincent Atassi

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

2005

A Feasible Algorithm for Typing in Elementary Affine Logic.

[BibT_eX]

[DOI]

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

2004

Type inference for light affine logic via constraints on words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Light Types for Polynomial Time Computation in Lambda-Calculus.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

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

[BibT_eX]

[DOI]

Amal El Fallah Seghrouchni

Virgile Mogbil

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

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

[BibT_eX]

[DOI]

Alexandru Suna

Christophe Fouqueré

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

2002

Checking Polynomial Time Complexity with Types.

[BibT_eX]

[DOI]

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

1999

Elementary Complexity and Geometry of Interaction.

[BibT_eX]

[DOI]