| Publication | Date of Publication | Type |
|---|
| Intrinsic theories and computational complexity | 2023-12-12 | Paper |
| Algorithmically broad languages for polynomial time and space | 2022-06-24 | Paper |
| Finitism, imperative programs and primitive recursion | 2022-02-08 | Paper |
| Implicit complexity for coinductive data: a characterization of corecurrence | 2021-03-17 | Paper |
| The Ackermann Award 2017 | 2020-05-26 | Paper |
| Finitism, imperative programs and primitive recursion | 2020-05-06 | Paper |
| Primitive recursion in the abstract | 2020-03-11 | Paper |
| A generic imperative language for polynomial time | 2019-11-10 | Paper |
| Global semantic typing for inductive and coinductive computing | 2017-02-02 | Paper |
| Ramified Corecurrence and Logspace | 2016-07-15 | Paper |
| Inductive completeness of logics of programs | 2016-05-06 | Paper |
| The computational contents of ramified corecurrence | 2015-10-01 | Paper |
| Global semantic typing for inductive and coinductive computing | 2015-01-15 | Paper |
| Propositional dynamic logic with program quantifiers | 2014-05-13 | Paper |
| Alternating Turing machines for inductive languages | 2013-10-01 | Paper |
| Feasible functionals and intersection of ramified types | 2013-08-16 | Paper |
| Evolving Graph-Structures and Their Implicit Computational Complexity | 2013-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3012530 | 2011-07-06 | Paper |
| The functions provable by first order abstraction | 2011-05-06 | Paper |
| Feasible functions over co-inductive data | 2010-09-29 | Paper |
| On the Completeness of Dynamic Logic | 2009-03-31 | Paper |
| Logical undecidabilities made easy | 2009-02-10 | Paper |
| Reasoning in Dynamic Logic about Program Termination | 2008-03-25 | Paper |
| Foundations of Software Science and Computation Structures | 2007-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5714440 | 2006-01-02 | Paper |
| Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474861 | 2004-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428884 | 2003-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411835 | 2003-07-10 | Paper |
| Intrinsic reasoning about functional programs. I: First order theories | 2002-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501154 | 2000-09-03 | Paper |
| Stratified polymorphism and primitive recursion | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945219 | 2000-03-23 | Paper |
| Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity | 1999-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4850553 | 1996-08-27 | Paper |
| Functions over free algebras definable in the simply typed lambda calculus | 1994-07-20 | Paper |
| A foundational delineation of poly-time | 1994-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281479 | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3142166 | 1993-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035315 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010361 | 1992-09-27 | Paper |
| Finitely stratified polymorphism | 1992-06-25 | Paper |
| Inductive definitions over finite structures | 1990-01-01 | Paper |
| Markov's rule revisited | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3035278 | 1990-01-01 | Paper |
| Descriptive characterizations of computational complexity | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3204027 | 1989-01-01 | Paper |
| Meager and replete failures of relative completeness | 1988-01-01 | Paper |
| Typing and computational properties of lambda expressions | 1986-01-01 | Paper |
| Syntactic translations and provably recursive functions | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680246 | 1985-01-01 | Paper |
| The Expressiveness of Simple and Second-Order Type Structures | 1983-01-01 | Paper |
| The optimality of induction as an axiomatization of arithmetic | 1983-01-01 | Paper |
| Unprovability of theorems of complexity theory in weak number theories | 1982-01-01 | Paper |
| On the proof theory of the modal logic for arithmetic provability | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3919674 | 1981-01-01 | Paper |
| Implicational complexity in intuitionistic arithmetic | 1981-01-01 | Paper |
| Innocuous substitutions | 1980-01-01 | Paper |
| Assumption Classes in Natural Deduction | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4135468 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4083402 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5675348 | 1973-01-01 | Paper |
