| Publication | Date of Publication | Type |
|---|
| Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories | 2023-11-25 | Paper |
| Effectful normal form bisimulation | 2023-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168449 | 2023-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6159939 | 2023-06-23 | Paper |
| On counting propositional logic and Wagner's hierarchy | 2023-06-21 | Paper |
| Implicit computation complexity in higher-order programming languages | 2023-02-06 | Paper |
| Implicit recursion-theoretic characterizations of counting classes | 2022-10-18 | Paper |
| On the Versatility of Open Logical Relations | 2022-10-13 | Paper |
| Differential logical relations, Part I: The simply-typed case | 2022-07-21 | Paper |
| On the Taylor expansion of probabilistic λ-terms | 2022-07-18 | Paper |
| The geometry of Bayesian programming | 2022-05-17 | Paper |
| On bisimilarity in lambda calculi with continuous probabilistic choice | 2022-04-29 | Paper |
| On Quantitative Algebraic Higher-Order Theories | 2022-04-28 | Paper |
| On measure quantifiers in first-order arithmetic | 2022-03-22 | Paper |
| Curry and Howard Meet Borel | 2022-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5028447 | 2022-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5015214 | 2021-12-06 | Paper |
| Differential logical relations. II: Increments and derivatives | 2021-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4986180 | 2021-04-27 | Paper |
| On Measure Quantifiers in First-Order Arithmetic (Long Version) | 2021-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4965859 | 2021-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4963998 | 2021-02-24 | Paper |
| On Probabilistic λ-Calculi | 2021-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144659 | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144664 | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5129945 | 2020-11-03 | Paper |
| Decomposing probabilistic lambda calculi | 2020-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111892 | 2020-05-27 | Paper |
| On randomised strategies in the \(\lambda \)-calculus | 2020-04-21 | Paper |
| Effectful applicative similarity for call-by-name lambda calculi | 2020-04-21 | Paper |
| Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs | 2019-10-25 | Paper |
| Probabilistic Recursion Theory and Implicit Computational Complexity | 2019-02-08 | Paper |
| On probabilistic term rewriting | 2018-07-09 | Paper |
| On sharing, memoization, and polynomial time | 2018-06-14 | Paper |
| Beta reduction is invariant, indeed | 2018-04-23 | Paper |
| The geometry of synchronization | 2018-04-23 | Paper |
| Parallelism and Synchronization in an Infinitary Context | 2018-04-23 | Paper |
| Metric reasoning about λ-terms: The affine case | 2018-04-23 | Paper |
| Infinitary Lambda Calculi from a Linear Perspective | 2018-04-23 | Paper |
| The geometry of parallelism: classical, probabilistic, and quantum effects | 2017-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5357721 | 2017-09-12 | Paper |
| On Higher-Order Probabilistic Subrecursion | 2017-05-19 | Paper |
| Metric Reasoning About $$\lambda $$-Terms: The General Case | 2017-05-19 | Paper |
| Probabilistic Termination by Monadic Affine Sized Typing | 2017-05-19 | Paper |
| Analysing the complexity of functional programs: higher-order meets first-order | 2017-05-10 | Paper |
| A lambda-calculus foundation for universal probabilistic programming | 2017-05-10 | Paper |
| Light logics and higher-order processes | 2017-04-04 | Paper |
| On session types and polynomial time | 2017-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2954984 | 2017-01-24 | Paper |
| Confluence Results for a Quantum Lambda Calculus with Measurements | 2016-10-07 | Paper |
| Higher-order interpretations and program complexity | 2016-05-03 | Paper |
| Computation by interaction for space-bounded functional programming | 2016-05-03 | Paper |
| (Leftmost-Outermost) Beta Reduction is Invariant, Indeed | 2016-03-11 | Paper |
| Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs | 2016-01-12 | Paper |
| Applicative Bisimulation and Quantum λ-Calculi | 2015-12-11 | Paper |
| On Applicative Similarity, Sequentiality, and Full Abstraction | 2015-11-04 | Paper |
| On Equivalences, Metrics, and Polynomial Time | 2015-09-29 | Paper |
| The geometry of linear higher-order recursion | 2015-09-17 | Paper |
| Context semantics, linear logic, and computational complexity | 2015-09-17 | Paper |
| A higher-order characterization of probabilistic polynomial time | 2015-05-04 | Paper |
| Probabilistic Recursion Theory and Implicit Computational Complexity | 2015-01-13 | Paper |
| The geometry of types | 2014-11-27 | Paper |
| On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi | 2014-04-16 | Paper |
| Measurements in Proof Nets as Higher-Order Quantum Circuits | 2014-04-16 | Paper |
| On coinductive equivalences for higher-order probabilistic functional programs | 2014-04-10 | Paper |
| Linear dependent types in a call-by-value scenario | 2014-03-25 | Paper |
| Complexity Analysis in Presence of Control Operators and Higher-Order Functions | 2014-01-17 | Paper |
| Linear Dependent Types and Relative Completeness | 2013-01-07 | Paper |
| Higher-Order Interpretations and Program Complexity | 2012-11-22 | Paper |
| A Higher-Order Characterization of Probabilistic Polynomial Time | 2012-11-02 | Paper |
| A Short Introduction to Implicit Computational Complexity | 2012-11-01 | Paper |
| On quasi-interpretations, blind abstractions and implicit complexity | 2012-09-06 | Paper |
| Probabilistic operational semantics for the lambda calculus | 2012-08-27 | Paper |
| On Constructor Rewrite Systems and the Lambda Calculus | 2012-08-15 | Paper |
| Realizability models and implicit complexity | 2011-05-10 | Paper |
| Light logics and optimal reduction: completeness and complexity | 2011-02-21 | Paper |
| Bounded Linear Logic, Revisited | 2010-12-20 | Paper |
| Derivational Complexity Is an Invariant Cost Model | 2010-09-14 | Paper |
| A semantic proof of polytime soundness of light affine logic | 2010-08-13 | Paper |
| Functional Programming in Sublinear Space | 2010-05-04 | Paper |
| Theoretical Computer Science | 2010-02-23 | Paper |
| Theoretical Computer Science | 2010-02-23 | Paper |
| Proofs as Efficient Programs | 2010-01-11 | Paper |
| Quantum implicit computational complexity | 2009-12-15 | Paper |
| On Constructor Rewrite Systems and the Lambda-Calculus | 2009-07-14 | Paper |
| Bounded Linear Logic, Revisited | 2009-07-07 | Paper |
| On a measurement-free quantum lambda calculus with classical control | 2009-05-06 | Paper |
| Light Logics and the Call-by-Value Lambda Calculus | 2009-04-29 | Paper |
| Taming Modal Impredicativity: Superlazy Reduction | 2009-02-24 | Paper |
| Quantitative Game Semantics for Linear Logic | 2008-11-20 | Paper |
| The weak lambda calculus as a reasonable machine | 2008-06-24 | Paper |
| A Semantic Proof of Polytime Soundness of Light Affine Logic | 2008-06-05 | Paper |
| Logical Approaches to Computational Barriers | 2007-04-30 | Paper |
| Compact and tractable automaton-based representations of time granularities | 2007-04-13 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| On light logics, uniform encodings and polynomial time | 2006-08-28 | Paper |
| Types for Proofs and Programs | 2005-12-23 | Paper |
| Typed Lambda Calculi and Applications | 2005-11-11 | Paper |
| Phase semantics and decidability of elementary affine logic | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778773 | 2002-11-19 | Paper |
