| Publication | Date of Publication | Type |
|---|
| Combining computation and deduction | 2024-09-06 | Paper |
| A lambda calculus satellite | 2024-03-01 | Paper |
| Termination for the direct sum of left-linear term rewriting systems | 2022-12-09 | Paper |
| Partial combinatory algebra and generalized numberings | 2022-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5119396 | 2020-09-04 | Paper |
| Partial combinatory algebra and generalized numberings | 2019-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5224680 | 2019-07-24 | Paper |
| Fixed point theorems for precomplete numberings | 2019-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4619823 | 2019-02-07 | Paper |
| A two-level approach towards lean proof-checking | 2019-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4596793 | 2017-12-11 | Paper |
| Automata Theoretic Account of Proof Search | 2017-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5507097 | 2016-12-16 | Paper |
| Foundations of Mathematics from the Perspective of Computer Verification | 2015-07-08 | Paper |
| In memoriam: Nicolaas Govert de Bruijn (1918--2012). The consciousness model | 2014-08-28 | Paper |
| An Ontology of States | 2014-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4912847 | 2013-03-27 | Paper |
| Loader and Urzyczyn Are Logically Related | 2012-11-01 | Paper |
| Reasoning about Constants in Nominal Isabelle or How to Formalize the Second Fixed Point Theorem | 2011-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3077958 | 2011-02-18 | Paper |
| Applications of infinitary lambda calculus | 2009-06-08 | Paper |
| The challenge of computer mathematics | 2009-01-20 | Paper |
| Towards the range property for the lambda theory \(\mathcal H\) | 2008-06-24 | Paper |
| Processes, Terms and Cycles: Steps on the Road to Infinity | 2006-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4664918 | 2005-04-09 | Paper |
| Electronic communication of mathematics and the interaction of computer algebra systems and proof assistants | 2004-08-06 | Paper |
| Discriminating coded lambda terms | 2003-09-22 | Paper |
| Autarkic computations in formal proofs | 2002-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2778865 | 2002-03-21 | Paper |
| Proof-assistants using dependent type systems | 2001-12-04 | Paper |
| Applications of Plotkin-terms: partitions and morphisms for closed terms | 2000-10-17 | Paper |
| Lambda terms for natural deduction, sequent calculus and cut elimination | 2000-06-07 | Paper |
| Introduction to generalized type systems | 2000-02-09 | Paper |
| Introduction to generalized type systems | 2000-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263832 | 1999-09-22 | Paper |
| Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus | 1999-03-07 | Paper |
| Completeness of the propositions-as-types interpretation of intuitionistic logic into illative combinatory logic | 1999-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4397043 | 1998-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385533 | 1998-05-14 | Paper |
| Termination for direct sums of left-linear complete term rewriting systems | 1998-01-28 | Paper |
| The Impact of the Lambda Calculus in Logic and Computer Science | 1997-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4865608 | 1996-02-15 | Paper |
| Enumerators of lambda terms are reducing constructively | 1995-08-27 | Paper |
| Theoretical Pearls:Representing ‘undefined’ in lambda calculus | 1995-07-20 | Paper |
| Theoretical PearlsEnumerators of lambda terms are reducing | 1995-07-20 | Paper |
| Constructive proofs of the range property in lambda calculus | 1994-09-26 | Paper |
| Systems of illative combinatory logic complete for first-order propositional and predicate calculus | 1994-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038654 | 1993-05-18 | Paper |
| LEAN: An intermediate language based on graph rewriting | 1989-01-01 | Paper |
| Needed reduction and spine strategies for the lambda calculus | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4721208 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3731013 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3728878 | 1985-01-01 | Paper |
| The lambda calculus. Its syntax and semantics. Rev. ed. | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3221960 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3342534 | 1984-01-01 | Paper |
| A filter lambda model and the completeness of type assignment | 1983-01-01 | Paper |
| Recursion theoretic operators and morphisms on numbered sets | 1983-01-01 | Paper |
| Semantics for classical AUTOMATH and related systems | 1983-01-01 | Paper |
| The lambda calculus, its syntax and semantics | 1981-01-01 | Paper |
| Degrees of sensible lambda theories | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3889024 | 1977-01-01 | Paper |
| A global representation of the recursive functions in the \(\lambda\)- calculus | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4182476 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4085718 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4100066 | 1975-01-01 | Paper |
| Pairing Without Conventional Restraints | 1974-01-01 | Paper |
| Combinatory logic and the ω-rule | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5181345 | 1973-01-01 | Paper |
| A characterization of terms of the λI-calculus having a normal form | 1973-01-01 | Paper |
