| Publication | Date of Publication | Type |
|---|
| Holonomic equations and efficient random generation of binary trees | 2024-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6173574 | 2023-07-21 | Paper |
| Almost all Classical Theorems are Intuitionistic | 2023-01-23 | Paper |
| Explicit substitutions with de bruijn's levels | 2022-12-09 | Paper |
| L-types for resource awareness: an implicit name approach | 2021-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993337 | 2021-06-15 | Paper |
| Almost all classical theorems are intuitionistic | 2021-04-14 | Paper |
| Extensive Infinite Games and Escalation, an exercise in Agda | 2020-06-19 | Paper |
| On the enumeration of closures and environments with an application to random generation | 2019-11-26 | Paper |
| Dependent Types for Extensive Games | 2019-09-18 | Paper |
| Combinatorics of $\lambda$-terms: a natural approach | 2018-11-20 | Paper |
| Quantitative Aspects of Linear and Affine Closed Lambda Terms | 2018-08-20 | Paper |
| Combinatorics of explicit substitutions | 2018-04-11 | Paper |
| Counting and generating terms in the binary lambda calculus | 2017-10-23 | Paper |
| A Natural Counting of Lambda Terms | 2016-03-10 | Paper |
| Counting terms in the binary lambda calculus | 2016-03-01 | Paper |
| Resource control and intersection types: an intrinsic connection | 2014-12-06 | Paper |
| On semantics of a term calculus for classical logic | 2014-11-14 | Paper |
| Counting and generating lambda terms | 2014-02-27 | Paper |
| Intersection and union types in the \(\bar{\lambda}\mu\tilde{\mu}\)-calculus | 2013-10-02 | Paper |
| Addressed term rewriting systems: syntax, semantics, and pragmatics (extended abstract) | 2013-09-25 | Paper |
| A Simple Case of Rationality of Escalation | 2013-09-13 | Paper |
| A journey through resource control lambda calculi and explicit substitution using intersection types (an account) | 2013-06-10 | Paper |
| Common Knowledge Logic in a Higher Order Proof Assistant | 2013-04-19 | Paper |
| On counting untyped lambda terms | 2013-03-27 | Paper |
| ``Backward coinduction, Nash equilibrium and the rationality of escalation | 2012-10-15 | Paper |
| Computational interpretation of classical logic with explicit structural rules | 2012-03-21 | Paper |
| Intersection Types for the Resource Control Lambda Calculi | 2012-01-06 | Paper |
| Resource control and strong normalisation | 2011-12-15 | Paper |
| Intuitionistic Sequent-Style Calculus with Explicit Structural Rules | 2011-07-29 | Paper |
| Computation with classical sequents | 2008-08-15 | Paper |
| Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage | 2008-06-24 | Paper |
| Strong Normalization of the Dual Classical Sequent Calculus | 2008-05-27 | Paper |
| Mechanizing common knowledge logic using COQ | 2007-08-23 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
| Addressed term rewriting systems: application to a typed object calculus | 2006-08-28 | Paper |
| Types for Proofs and Programs | 2005-12-23 | Paper |
| Intersection types for explicit substitutions | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4430288 | 2003-10-20 | Paper |
| Reductions, intersection types, and explicit substitutions | 2003-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2778819 | 2002-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4506396 | 2000-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4264735 | 1999-10-10 | Paper |
| λν, a calculus of explicit substitutions which preserves strong normalisation | 1997-04-29 | Paper |
| Valentin Antimirov (1961--1995) | 1997-02-27 | Paper |
| Termination of rewrite systems by elementary interpretations | 1995-05-11 | Paper |
| On termination of one rule rewrite systems | 1994-09-25 | Paper |
| Algebraic and logic programming. International workshop, Gaussig, GDR, November 14-18, 1988. Proceedings | 1993-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035223 | 1993-05-18 | Paper |
| Well rewrite orderings and well quasi-orderings | 1993-05-16 | Paper |
| The term rewriting approach to automated theorem proving | 1992-11-10 | Paper |
| Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness | 1990-01-01 | Paper |
| Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems | 1990-01-01 | Paper |
| On the recursive decomposition ordering with lexicographical status and other related orderings | 1990-01-01 | Paper |
| Termination by completion | 1990-01-01 | Paper |
| Equational problems and disunification | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3496370 | 1989-01-01 | Paper |
| Termination of rewriting systems by polynomial interpretations and its implementation | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3757390 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783522 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783523 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3696486 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3336738 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3336681 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3664414 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3659124 | 1983-01-01 | Paper |
| Behavioural Categoricity of Abstract Data Type Specifications | 1983-01-01 | Paper |
| On multiset orderings | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3953140 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3667939 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3659121 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3916004 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195916 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3947712 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4156824 | 1977-01-01 | Paper |
| An exercise on streams: convergence acceleration | N/A | Paper |
