| Publication | Date of Publication | Type |
|---|
| The existential fragment of second-order propositional intuitionistic logic is undecidable | 2024-03-20 | Paper |
| Kripke Semantics for Intersection Formulas | 2022-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993851 | 2021-06-10 | Paper |
| First-order Answer Set Programming as Constructive Proof Search | 2018-12-04 | Paper |
| Answer set programming in intuitionistic logic | 2018-01-12 | Paper |
| How Hard Is Positive Quantification? | 2017-07-13 | Paper |
| Restricted Positive Quantification Is Not Elementary | 2017-07-12 | Paper |
| On the Mints Hierarchy in First-Order Intuitionistic Logic | 2017-04-11 | Paper |
| Intuitionistic games: determinacy, completeness, and normalization | 2016-10-27 | Paper |
| Type fixpoints, iteration vs. recursion | 2016-09-01 | Paper |
| On the Mints Hierarchy in First-Order Intuitionistic Logic | 2015-10-01 | Paper |
| Bounded Combinatory Logic | 2012-11-22 | Paper |
| The Complexity of Inhabitation with Explicit Intersection | 2012-07-16 | Paper |
| Finite Combinatory Logic with Intersection Types | 2011-06-17 | Paper |
| The Logic of Persistent Intersection | 2011-05-18 | Paper |
| A syntactic embedding of predicate logic into second-order propositional logic | 2010-12-01 | Paper |
| Positive recursive type assignment | 2010-06-17 | Paper |
| Inhabitation of Low-Rank Intersection Types | 2009-07-07 | Paper |
| Strong cut-elimination in sequent calculus using Klop's ι-translation and perpetual reductions | 2009-03-23 | Paper |
| In the Search of a Naive Type Theory | 2008-06-03 | Paper |
| Predicates as types | 2008-01-14 | Paper |
| Lectures on the Curry-Howard isomorphism | 2007-05-30 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Types for Proofs and Programs | 2005-12-23 | Paper |
| Computer Science Logic | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024919 | 2005-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738227 | 2004-08-11 | Paper |
| A simple proof of the undecidability of strong normalisation | 2003-06-23 | Paper |
| Alpha-conversion and typability | 2003-01-14 | Paper |
| Discrimination by parallel observers: the algorithm. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2778825 | 2002-03-21 | Paper |
| The subtyping problem for second-order types is undecidable. | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501164 | 2000-09-03 | Paper |
| The emptiness problem for intersection types | 2000-01-17 | Paper |
| Type reconstruction in Fω | 1998-03-24 | Paper |
| Comparing cubes of typed and type assignment systems | 1997-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4332424 | 1997-06-03 | Paper |
| An analysis of ML typability | 1995-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281489 | 1994-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3142168 | 1993-12-05 | Paper |
| The undecidability of the semi-unification problem | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4027630 | 1993-02-21 | Paper |
| On the expressive power of finitely typed and universally polymorphic recursive procedures | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3204025 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3829053 | 1989-01-01 | Paper |
| Some relationships between logics of programs and complexity theory | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3769949 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785900 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3766818 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3764130 | 1987-01-01 | Paper |
| ``During cannot be expressed by ``after | 1986-01-01 | Paper |
| Necessary and sufficient conditions for the universality of programming formalisms | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3345772 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5184368 | 1984-01-01 | Paper |
| A necessary and sufficient condition in order that a Herbrand interpretation be expressive relative to recursive programs | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3326828 | 1983-01-01 | Paper |
| Nontrivial definability by flow-chart programs | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3314965 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3967042 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3969853 | 1982-01-01 | Paper |
| The unwind property in certain algebras | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3966122 | 1981-01-01 | Paper |
