| Publication | Date of Publication | Type |
|---|
| Alternating Turing machines and the analytical hierarchy | 2026-01-14 | Paper |
| A characterization of NC by tree recurrence | 2025-10-29 | Paper |
Intrinsic theories and computational complexity
Lecture Notes in Computer Science | 2023-12-12 | Paper |
| Algorithmically broad languages for polynomial time and space | 2022-06-24 | Paper |
Finitism, imperative programs and primitive recursion
Journal Of Logic And Computation | 2022-02-08 | Paper |
| Implicit complexity for coinductive data: a characterization of corecurrence | 2021-03-17 | Paper |
Implicit complexity for coinductive data: a characterization of corecurrence
(available as arXiv preprint) | 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
Mathematical Structures in Computer Science | 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
Electronic Notes in Theoretical Computer Science | 2016-07-15 | Paper |
Inductive completeness of logics of programs
Electronic Notes in Theoretical Computer Science | 2016-05-06 | Paper |
The computational contents of ramified corecurrence
Lecture Notes in Computer Science | 2015-10-01 | Paper |
Global semantic typing for inductive and coinductive computing
Logical Methods in Computer Science | 2015-01-15 | Paper |
Propositional dynamic logic with program quantifiers
Electronic Notes in Theoretical Computer Science | 2014-05-13 | Paper |
Alternating Turing machines for inductive languages
Logical Methods in Computer Science | 2013-10-01 | Paper |
Feasible functionals and intersection of ramified types
Electronic Notes in Theoretical Computer Science | 2013-08-16 | Paper |
Evolving Graph-Structures and Their Implicit Computational Complexity
Automata, Languages, and Programming | 2013-08-07 | Paper |
| scientific article; zbMATH DE number 5917716 (Why is no real title available?) | 2011-07-06 | Paper |
The functions provable by first order abstraction
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-05-06 | Paper |
Feasible functions over co-inductive data
Logic, Language, Information and Computation | 2010-09-29 | Paper |
On the Completeness of Dynamic Logic
Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
| Logical undecidabilities made easy | 2009-02-10 | Paper |
Reasoning in Dynamic Logic about Program Termination
Pillars of Computer Science | 2008-03-25 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-09-28 | Paper |
| scientific article; zbMATH DE number 2242587 (Why is no real title available?) | 2006-01-02 | Paper |
Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion
Theoretical Computer Science | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2079048 (Why is no real title available?) | 2004-07-21 | Paper |
| scientific article; zbMATH DE number 1984519 (Why is no real title available?) | 2003-09-22 | Paper |
| scientific article; zbMATH DE number 1948174 (Why is no real title available?) | 2003-07-10 | Paper |
Intrinsic reasoning about functional programs. I: First order theories
Annals of Pure and Applied Logic | 2002-06-02 | Paper |
| scientific article; zbMATH DE number 1499100 (Why is no real title available?) | 2000-09-03 | Paper |
Stratified polymorphism and primitive recursion
Mathematical Structures in Computer Science | 2000-05-04 | Paper |
| scientific article; zbMATH DE number 1424029 (Why is no real title available?) | 2000-03-23 | Paper |
Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
Annals of Pure and Applied Logic | 1999-07-20 | Paper |
| scientific article; zbMATH DE number 806752 (Why is no real title available?) | 1996-08-27 | Paper |
Functions over free algebras definable in the simply typed lambda calculus
Theoretical Computer Science | 1994-07-20 | Paper |
A foundational delineation of poly-time
Information and Computation | 1994-06-19 | Paper |
| scientific article; zbMATH DE number 512786 (Why is no real title available?) | 1994-03-10 | Paper |
| scientific article; zbMATH DE number 445159 (Why is no real title available?) | 1993-12-05 | Paper |
| scientific article; zbMATH DE number 176211 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 65750 (Why is no real title available?) | 1992-09-27 | Paper |
Finitely stratified polymorphism
Information and Computation | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 4134036 (Why is no real title available?) | 1990-01-01 | Paper |
Inductive definitions over finite structures
Information and Computation | 1990-01-01 | Paper |
Markov's rule revisited
Archive for Mathematical Logic | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4180774 (Why is no real title available?) | 1989-01-01 | Paper |
Descriptive characterizations of computational complexity
Journal of Computer and System Sciences | 1989-01-01 | Paper |
Meager and replete failures of relative completeness
Journal of the ACM | 1988-01-01 | Paper |
Typing and computational properties of lambda expressions
Theoretical Computer Science | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3902002 (Why is no real title available?) | 1985-01-01 | Paper |
Syntactic translations and provably recursive functions
Journal of Symbolic Logic | 1985-01-01 | Paper |
The Expressiveness of Simple and Second-Order Type Structures
Journal of the ACM | 1983-01-01 | Paper |
The optimality of induction as an axiomatization of arithmetic
Journal of Symbolic Logic | 1983-01-01 | Paper |
Unprovability of theorems of complexity theory in weak number theories
Theoretical Computer Science | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3732007 (Why is no real title available?) | 1981-01-01 | Paper |
On the proof theory of the modal logic for arithmetic provability
Journal of Symbolic Logic | 1981-01-01 | Paper |
Implicational complexity in intuitionistic arithmetic
Journal of Symbolic Logic | 1981-01-01 | Paper |
Innocuous substitutions
Journal of Symbolic Logic | 1980-01-01 | Paper |
Assumption Classes in Natural Deduction
Mathematical Logic Quarterly | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3563037 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3563037 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3503206 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3411008 (Why is no real title available?) | 1973-01-01 | Paper |
