| Publication | Date of Publication | Type |
|---|
A characterization of basic feasible functionals through higher-order rewriting and tuple interpretations
Logical Methods in Computer Science | 2026-02-13 | Paper |
| A linear type system for \(L^p\)-metric sensitivity analysis | 2026-01-14 | Paper |
| BiGKAT: an algebraic framework for relational verification of probabilistic programs | 2025-12-04 | Paper |
| On basic feasible functionals and the interpretation method | 2024-10-30 | Paper |
| Bunched Fuzz: sensitivity for vector metrics | 2023-11-24 | Paper |
scientific article; zbMATH DE number 7730636 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-21 | Paper |
| scientific article; zbMATH DE number 7533334 (Why is no real title available?) | 2022-05-28 | Paper |
| Types for complexity of parallel computation in pi-calculus | 2021-10-18 | Paper |
Combining linear logic and size types for implicit complexity
Theoretical Computer Science | 2020-04-21 | Paper |
Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs
Journal of Automated Reasoning | 2019-10-25 | Paper |
Characterizing polynomial and exponential complexity classes in elementary lambda-calculus
Information and Computation | 2018-06-14 | Paper |
| Free-cut elimination in linear logic and an application to a feasible arithmetic | 2017-07-19 | Paper |
Higher-order interpretations and program complexity
Information and Computation | 2016-05-03 | Paper |
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs
Logic for Programming, Artificial Intelligence, and Reasoning | 2016-01-12 | Paper |
On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy
Information and Computation | 2015-05-04 | Paper |
Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus
Advanced Information Systems Engineering | 2014-09-15 | Paper |
| Higher-order interpretations and program complexity | 2012-11-22 | Paper |
On quasi-interpretations, blind abstractions and implicit complexity
MSCS. Mathematical Structures in Computer Science | 2012-09-06 | Paper |
Light logics and optimal reduction: completeness and complexity
Information and Computation | 2011-02-21 | Paper |
A polytime functional language from light linear logic
Programming Languages and Systems | 2010-05-04 | Paper |
Linear logic by levels and bounded time complexity
Theoretical Computer Science | 2009-12-15 | Paper |
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic
Computer Science Logic | 2009-03-12 | Paper |
From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing
Lecture Notes in Computer Science | 2009-03-10 | Paper |
Light types for polynomial time computation in lambda calculus
Information and Computation | 2009-03-02 | Paper |
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
Logical Methods in Computer Science | 2008-04-01 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-09-28 | Paper |
On light logics, uniform encodings and polynomial time
Mathematical Structures in Computer Science | 2006-08-28 | Paper |
Typed Lambda Calculi and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Type inference for light affine logic via constraints on words
Theoretical Computer Science | 2005-01-11 | Paper |
Stratified coherence spaces: A denotational semantics for light linear logic
Theoretical Computer Science | 2004-08-06 | Paper |
Elementary complexity and geometry of interaction
Fundamenta Informaticae | 2001-11-23 | Paper |
| scientific article; zbMATH DE number 1342271 (Why is no real title available?) | 2000-02-28 | Paper |
| scientific article; zbMATH DE number 1223612 (Why is no real title available?) | 1999-03-18 | Paper |
