| 2008 |
|---|
| 28 | EE | Helmut Schwichtenberg:
Dialectica interpretation of well-founded induction.
Math. Log. Q. 54(3): 229-239 (2008) |
| 2006 |
|---|
| 27 | EE | Helmut Schwichtenberg:
Inverting Monotone Continuous Functions in Constructive Analysis.
CiE 2006: 490-504 |
| 26 | EE | Helmut Schwichtenberg:
Minlog.
The Seventeen Provers of the World 2006: 151-157 |
| 25 | EE | Ulrich Berger,
Stefan Berghofer,
Pierre Letouzey,
Helmut Schwichtenberg:
Program Extraction from Normalization Proofs.
Studia Logica 82(1): 25-49 (2006) |
| 24 | EE | Helmut Schwichtenberg:
An arithmetic for polynomial-time computation.
Theor. Comput. Sci. 357(1-3): 202-214 (2006) |
| 2005 |
|---|
| 23 | EE | Helmut Schwichtenberg:
A Direct Proof of the Equivalence between Brouwer's Fan Theorem and König's Lemma with a Uniqueness Hypothesis.
J. UCS 11(12): 2086-2095 (2005) |
| 2004 |
|---|
| 22 | EE | Helmut Schwichtenberg:
Proof Search in Minimal Logic.
AISC 2004: 15-25 |
| 21 | EE | Klaus Aehlig,
Ulrich Berger,
Martin Hofmann,
Helmut Schwichtenberg:
An arithmetic for non-size-increasing polynomial-time computation.
Theor. Comput. Sci. 318(1-2): 3-27 (2004) |
| 2003 |
|---|
| 20 | EE | Ulrich Berger,
Matthias Eberl,
Helmut Schwichtenberg:
Term rewriting for normalization by evaluation.
Inf. Comput. 183(1): 19-42 (2003) |
| 2002 |
|---|
| 19 | EE | Klaus Aehlig,
Helmut Schwichtenberg:
A syntactical analysis of non-size-increasing polynomial time computation.
ACM Trans. Comput. Log. 3(3): 383-401 (2002) |
| 18 | | Ulrich Berger,
Wilfried Buchholz,
Helmut Schwichtenberg:
Refined program extraction form classical proofs.
Ann. Pure Appl. Logic 114(1-3): 3-25 (2002) |
| 2001 |
|---|
| 17 | EE | Klaus Aehlig,
Jan Johannsen,
Helmut Schwichtenberg,
Sebastiaan Terwijn:
Linear Ramified Higher Type Recursion and Parallel Complexity.
Proof Theory in Computer Science 2001: 1-21 |
| 16 | | Ulrich Berger,
Helmut Schwichtenberg,
Monika Seisenberger:
The Warshall Algorithm and Dickson?s Lemma: Two Examples of Realistic Program Extraction.
J. Autom. Reasoning 26(2): 205-221 (2001) |
| 2000 |
|---|
| 15 | | Peter Clote,
Helmut Schwichtenberg:
Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau, Germany, August 21-26, 2000, Proceedings
Springer 2000 |
| 14 | EE | Klaus Aehlig,
Helmut Schwichtenberg:
A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation.
LICS 2000: 84-91 |
| 13 | | Stephen J. Bellantoni,
Karl-Heinz Niggl,
Helmut Schwichtenberg:
Higher type recursion, ramification and polynomial time.
Ann. Pure Appl. Logic 104(1-3): 17-30 (2000) |
| 12 | EE | Klaus Aehlig,
Helmut Schwichtenberg:
A syntactical analysis of non-size-increasing polynomial time computation
CoRR cs.LO/0011037: (2000) |
| 1999 |
|---|
| 11 | | Helmut Schwichtenberg:
Monotone Majorizable Functionals.
Studia Logica 62(2): 283-289 (1999) |
| 10 | EE | Helmut Schwichtenberg:
Termination of Permutative Conversions in Intuitionistic Gentzen Calculi.
Theor. Comput. Sci. 212(1-2): 247-260 (1999) |
| 1998 |
|---|
| 9 | EE | Ulrich Berger,
Matthias Eberl,
Helmut Schwichtenberg:
Normalisation by Evaluation.
Prospects for Hardware Foundations 1998: 117-137 |
| 8 | | Helmut Schwichtenberg:
Finite Notations for Infinite Terms.
Ann. Pure Appl. Logic 94(1-3): 201-222 (1998) |
| 1995 |
|---|
| 7 | | Jaco van de Pol,
Helmut Schwichtenberg:
Strict Functionals for Termination Proofs.
TLCA 1995: 350-364 |
| 6 | EE | Ulrich Berger,
Helmut Schwichtenberg:
The Greatest Common Divisor: A Case Study for Program Extraction from Classical Proofs.
TYPES 1995: 36-46 |
| 1994 |
|---|
| 5 | | Ulrich Berger,
Helmut Schwichtenberg:
Program Extraction from Classical Proofs.
LCC 1994: 77-97 |
| 1991 |
|---|
| 4 | | Helmut Schwichtenberg:
Minimal from Classical Proofs.
CSL 1991: 326-328 |
| 3 | | Ulrich Berger,
Helmut Schwichtenberg:
An Inverse of the Evaluation Functional for Typed lambda-calculus
LICS 1991: 203-211 |
| 1987 |
|---|
| 2 | | Helmut Schwichtenberg:
Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen.
Computation Theory and Logic 1987: 334-348 |
| 1979 |
|---|
| 1 | | Helmut Schwichtenberg:
On Bar Recursion of Types 0 and 1.
J. Symb. Log. 44(3): 325-329 (1979) |
