| Publication | Date of Publication | Type |
|---|
| A faithful and quantitative notion of distant reduction for the lambda-calculus with generalized applications | 2024-09-04 | Paper |
| A strong bisimulation for a classical term calculus | 2024-06-27 | Paper |
| Rewriting with extensional polymorphic \(\lambda \)-calculus | 2024-06-21 | Paper |
| Solvability for generalized applications | 2024-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6124962 | 2024-04-10 | Paper |
| Node Replication: Theory And Practice | 2024-03-11 | Paper |
| Quantitative global memory | 2024-02-28 | Paper |
| A faithful and quantitative notion of distant reduction for generalized applications | 2024-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6079229 | 2023-10-27 | Paper |
| The bang calculus revisited | 2023-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874189 | 2023-02-07 | Paper |
| Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract) | 2022-12-09 | Paper |
| The spirit of node replication | 2021-10-18 | Paper |
| The bang calculus revisited | 2021-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5856410 | 2021-03-26 | Paper |
| Consuming and Persistent Types for Classical Logic | 2021-01-21 | Paper |
| Tight typings and split bounds, fully developed | 2020-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111900 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111320 | 2020-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5208874 | 2020-01-22 | Paper |
| Combining first order algebraic rewriting systems, recursion and extensional lambda calculi | 2019-04-29 | Paper |
| A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object | 2019-03-29 | Paper |
| Non-idempotent intersection types for the Lambda-Calculus | 2019-01-08 | Paper |
| A resource aware semantics for a focused intuitionistic calculus | 2018-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580327 | 2018-08-15 | Paper |
| Call-by-need, neededness and all that | 2018-07-17 | Paper |
| Strong normalization through intersection types and memory | 2018-04-23 | Paper |
| On abstract normalisation beyond neededness | 2018-02-09 | Paper |
| Observability for Pair Pattern Calculi | 2017-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2978530 | 2017-04-25 | Paper |
| λ-calculi with explicit substitutions and composition which preserve β-strong normalization | 2017-01-19 | Paper |
| Reasoning About Call-by-need by Means of Types | 2016-06-10 | Paper |
| A Resource Aware Computational Interpretation for Herbelin’s Syntax | 2016-02-25 | Paper |
| The Inhabitation Problem for Non-idempotent Intersection Types | 2014-09-15 | Paper |
| Quantitative Types for the Linear Substitution Calculus | 2014-09-15 | Paper |
| A nonstandard standardization theorem | 2014-04-10 | Paper |
| The Permutative λ-Calculus | 2012-06-15 | Paper |
| Preservation of strong normalisation modulo permutations for the structural \(\lambda\)-calculus | 2012-04-03 | Paper |
| A prismoid framework for languages with resources | 2011-12-23 | Paper |
| The Structural λ-Calculus | 2010-09-03 | Paper |
| The Prismoid of Resources | 2009-10-16 | Paper |
| A Theory of Explicit Substitutions with Safe and Full Composition | 2009-08-20 | Paper |
| First-class patterns | 2009-03-25 | Paper |
| Strong Cut-Elimination Systems for Hudelmaier’s Depth-Bounded Sequent Calculus for Implicational Logic | 2009-03-12 | Paper |
| The Theory of Calculi with Explicit Substitutions Revisited | 2009-03-05 | Paper |
| Perpetuality for Full and Safe Composition (in a Constructive Setting) | 2008-08-19 | Paper |
| Expression reduction systems with patterns | 2008-01-22 | Paper |
| Programming Languages and Systems | 2007-05-02 | Paper |
| Resource operators for \(\lambda\)-calculus | 2007-04-16 | Paper |
| Processes, Terms and Cycles: Steps on the Road to Infinity | 2006-11-13 | Paper |
| Relating Higher-order and First-order Rewriting | 2006-02-21 | Paper |
| de Bruijn Indices for Metaterms | 2006-02-21 | Paper |
| Term Rewriting and Applications | 2005-11-11 | Paper |
| Pattern matching as cut elimination | 2004-10-01 | Paper |
| Proof nets and explicit substitutions | 2004-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4447226 | 2004-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537518 | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2778870 | 2002-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723891 | 2001-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508294 | 2000-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4506392 | 2000-09-18 | Paper |
| Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4264714 | 1999-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259961 | 1999-09-08 | Paper |
| \(\lambda\)-calculi with explicit substitutions preserving strong normalization | 1999-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217940 | 1998-11-11 | Paper |
| Combining algebraic rewriting, extensional lambda calculi, and fixpoints | 1997-02-27 | Paper |
| A typed pattern calculus | 1996-03-27 | Paper |
| Simulating expansions without expansions | 1996-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035249 | 1993-05-18 | Paper |
