| Publication | Date of Publication | Type |
|---|
| Program extraction from classical proofs | 2023-12-12 | Paper |
| Computational Aspects of Bishop’s Constructive Mathematics | 2023-08-11 | Paper |
| Logic for Exact Real Arithmetic: Multiplication | 2023-08-04 | Paper |
| Lookahead analysis in exact real arithmetic with logical methods | 2023-01-05 | Paper |
| Mathematische Logik | 2021-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4989402 | 2021-05-25 | Paper |
| Program Extraction from Proofs: The Fan Theorem for Uniformly Coconvex Bars | 2020-08-10 | Paper |
| Higman’s Lemma and Its Computational Content | 2020-08-07 | Paper |
| Logic for Gray-code Computation | 2020-04-03 | Paper |
| Tiered Arithmetics | 2020-02-05 | Paper |
| Logic for exact real arithmetic | 2019-04-29 | Paper |
| The greatest common divisor: A case study for program extraction from classical proofs | 2019-01-15 | Paper |
| A bound for Dickson's lemma | 2017-10-12 | Paper |
| A syntactical analysis of non-size-increasing polynomial time computation | 2017-06-13 | Paper |
| Program extraction in exact real arithmetic | 2016-07-27 | Paper |
| Embedding classical in minimal implicational logic | 2016-03-17 | Paper |
| Viewing \({\lambda}\)-terms through maps | 2014-09-03 | Paper |
| Program Extraction from Nested Definitions | 2013-08-07 | Paper |
| Minimal from classical proofs | 2013-04-15 | Paper |
| Constructive aspects of Riemann's permutation theorem for series | 2013-03-28 | Paper |
| Proofs and Computations | 2012-01-27 | Paper |
| Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras | 2011-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3001103 | 2011-05-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3081644 | 2011-03-09 | Paper |
| Realizability interpretation of proofs in constructive analysis | 2009-05-08 | Paper |
| Program Extraction in Constructive Analysis | 2009-03-12 | Paper |
| Dialectica interpretation of well-founded induction | 2008-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5384980 | 2008-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5457388 | 2008-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5435637 | 2008-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5310891 | 2007-10-15 | Paper |
| Logical Approaches to Computational Barriers | 2007-04-30 | Paper |
| An arithmetic for polynomial-time computation | 2006-08-16 | Paper |
| Program extraction from normalization proofs | 2006-03-17 | Paper |
| Artificial Intelligence and Symbolic Computation | 2005-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024848 | 2005-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4663839 | 2005-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4823143 | 2004-10-26 | Paper |
| An arithmetic for non-size-increasing polynomial-time computation | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436023 | 2003-11-23 | Paper |
| Term rewriting for normalization by evaluation. | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4524766 | 2003-07-29 | Paper |
| Refined program extraction from classical proofs | 2002-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934291 | 2002-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2752052 | 2001-10-21 | Paper |
| The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction | 2001-02-18 | Paper |
| Higher type recursion, ramification and polynomial time | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499084 | 2000-08-28 | Paper |
| Finite notations for infinite terms | 2000-05-09 | Paper |
| Monotone majorizable functionals | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263834 | 1999-09-22 | Paper |
| Termination of permutative conversions in intuitionistic Gentzen calculi | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4397033 | 1998-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395618 | 1998-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4357067 | 1997-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4850555 | 1997-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4716271 | 1996-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4842532 | 1995-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4309506 | 1995-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138828 | 1993-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4202954 | 1993-09-06 | Paper |
| An upper bound for reduction sequences in the typed \(\lambda\)-calculus | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3801545 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3322097 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3322086 | 1982-01-01 | Paper |
| On bar recursion of types 0 and 1 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3874169 | 1979-01-01 | Paper |
| Definierbare Funktionen imλ-Kalkül mit Typen | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4079601 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4108311 | 1975-01-01 | Paper |
| Bemerkungen zum Spektralproblem | 1972-01-01 | Paper |
| Beweistheoretische Charakterisierung einer Erweiterung der Grzegorczyk-Hierarchie | 1972-01-01 | Paper |
| Eine Klassifikation der ε0‐Rekursiven Funktionen | 1971-01-01 | Paper |
| Rekursionszahlen und die Grzegorczyk-Hierarchie | 1969-01-01 | Paper |
