| Publication | Date of Publication | Type |
|---|
| Church's Semigroup Is Sq-Universal. | 2023-06-23 | Paper |
| On sets of terms having a given intersection type | 2022-10-06 | Paper |
| Finite generation and presentation problems for lambda calculus and combinatory logic | 2022-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5019689 | 2022-01-10 | Paper |
| Uniqueness typing for intersection types | 2021-05-05 | Paper |
| Simple SubTypes of Intersection Types | 2020-01-24 | Paper |
| On the representation of semigroups and other congruences in the lambda calculus | 2018-04-23 | Paper |
| How to think of intersection types as Cartesian products | 2018-04-23 | Paper |
| The completeness of BCD for an operational semantics | 2018-04-06 | Paper |
| Fixed points in lambda calculus. an eccentric survey of problems and solutions | 2018-01-12 | Paper |
| Effective reduction and conversion strategies for combinators | 2017-11-17 | Paper |
| Levy Labels and Recursive Types | 2017-07-21 | Paper |
| Taming the wild ant-lion; a counterexample to a conjecture of Böhm | 2017-06-14 | Paper |
| Lambda theories allowing terms with a finite number of fixed points | 2017-04-03 | Paper |
| A New Type Assignment for Strongly Normalizable Terms | 2017-02-02 | Paper |
| Cartesian Monoids | 2016-07-08 | Paper |
| Reflections on a Theorem of Henkin | 2015-11-27 | Paper |
| Near Semi-rings and Lambda Calculus | 2014-07-24 | Paper |
| On polymorphic types of untyped terms | 2014-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2882383 | 2012-05-04 | Paper |
| On Polymorphic Types of Untyped Terms | 2011-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3077958 | 2011-02-18 | Paper |
| The Omega Rule is $\mathbf{\Pi_{1}^{1}}$-Complete in the $\lambda\beta$-Calculus | 2009-06-30 | Paper |
| The Omega Rule is $\mathbf{\Pi_{1}^{1}}$ -Complete in the λβ-Calculus | 2009-03-10 | Paper |
| On the complexity of alpha conversion | 2008-02-25 | Paper |
| Solution of a Problem of Barendregt on Sensible lambda-Theories | 2007-10-11 | Paper |
| Processes, Terms and Cycles: Steps on the Road to Infinity | 2006-11-13 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
| Some results on extensionality in lambda calculus | 2005-02-23 | Paper |
| On the \(\lambda Y\) calculus | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767026 | 2002-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723901 | 2001-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708320 | 2001-04-17 | Paper |
| Applications of Plotkin-terms: partitions and morphisms for closed terms | 2000-10-17 | Paper |
| On the existence of n but not n + 1 easy combinators | 2000-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263881 | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263805 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4362934 | 1998-03-12 | Paper |
| On the unification problem for Cartesian closed categories | 1997-01-01 | Paper |
| Some examples of non-existent combinators | 1994-09-01 | Paper |
| On the editing distance between unordered labeled trees | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010370 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3487318 | 1990-01-01 | Paper |
| On sets of solutions to combinator equations | 1989-01-01 | Paper |
| The word problem for Smullyan's lark combinator is decidable | 1989-01-01 | Paper |
| Genus distributions for two classes of graphs | 1989-01-01 | Paper |
| An intersection problem for finite automata | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795665 | 1987-01-01 | Paper |
| Scott induction and closure under \(\omega\)-sups | 1986-01-01 | Paper |
| Solving functional equations at higher types; some examples and some theorems | 1986-01-01 | Paper |
| Every countable poset is embeddable in the poset of unsolvable terms | 1986-01-01 | Paper |
| Logical relations and the typed λ-calculus | 1985-01-01 | Paper |
| On the Structure of Armstrong Relations for Functional Dependencies | 1984-01-01 | Paper |
| λ-definable functionals andβη conversion | 1983-01-01 | Paper |
| Unifiability is complete for co-N Log Space | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3312273 | 1982-01-01 | Paper |
| Completeness, invariance and λ-definability | 1982-01-01 | Paper |
| Topological subgraphs of cubic graphs and a theorem of dirac | 1982-01-01 | Paper |
| Reductions of the graph reconstruction conjecture | 1981-01-01 | Paper |
| On the existence of closed terms in the typed lambda calculus II: Transformations of unification problems | 1981-01-01 | Paper |
| Speed-Up by Theories with Infinite Models | 1981-01-01 | Paper |
| Solution to a problem of Chang and Lee | 1980-01-01 | Paper |
| Worst Case Exponential Lower Bounds for Input Resolution with Paramodulation | 1980-01-01 | Paper |
| Intuitionistic propositional logic is polynomial-space complete | 1979-01-01 | Paper |
| The typed lambda-calculus is not elementary recursive | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3048829 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4187298 | 1979-01-01 | Paper |
| Lower Bounds on Herbrand's Theorem | 1979-01-01 | Paper |
| Bounds for proof-search and speed-up in the predicate calculus | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3882451 | 1977-01-01 | Paper |
