Helmut Schwichtenberg

Publication Activity (10 Years)

Years Active: 1975-2023
Publications (10 Years): 5

Top Topics

Monte Carlo Search

Finite Model Theory

Multidimensional Scaling

Program Execution

Top Venues

Log. Methods Comput. Sci.

Math. Struct. Comput. Sci.

Ann. Pure Appl. Log.

Publications

Nils Köpp, Helmut Schwichtenberg
Lookahead analysis in exact real arithmetic with logical methods. Theor. Comput. Sci. 943 (2023)
Helmut Schwichtenberg, Franziskus Wiesnet
Logic for exact real arithmetic. Log. Methods Comput. Sci. 17 (2) (2021)
Josef Berger, Helmut Schwichtenberg
A bound for Dickson's lemma. Log. Methods Comput. Sci. 13 (3) (2017)
Hajime Ishihara, Helmut Schwichtenberg
Embedding classical in minimal implicational logic. Math. Log. Q. 62 (1-2) (2016)
Hannes Leitgeb, Iosif Petrakis, Peter Schuster, Helmut Schwichtenberg
Editorial. FLAP 3 (4) (2016)
Kenji Miyamoto, Helmut Schwichtenberg
Program extraction in exact real arithmetic. Math. Struct. Comput. Sci. 25 (8) (2015)
Kenji Miyamoto, Fredrik Nordvall Forsberg, Helmut Schwichtenberg
Program Extraction from Nested Definitions. ITP (2013)
Helmut Schwichtenberg, Christoph Senjak
Minimal from classical proofs. Ann. Pure Appl. Log. 164 (6) (2013)
Ulrich Berger, Kenji Miyamoto, Helmut Schwichtenberg, Monika Seisenberger
Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras. CALCO (2011)
Helmut Schwichtenberg
Dialectica interpretation of well-founded induction. Math. Log. Q. 54 (3) (2008)
Helmut Schwichtenberg
Realizability interpretation of proofs in constructive analysis. Theory Comput. Syst. 43 (3-4) (2008)
Ulrich Berger, Stefan Berghofer, Pierre Letouzey, Helmut Schwichtenberg
Program Extraction from Normalization Proofs. Stud Logica 82 (1) (2006)
Helmut Schwichtenberg
Inverting Monotone Continuous Functions in Constructive Analysis. CiE (2006)
Helmut Schwichtenberg
An arithmetic for polynomial-time computation. Theor. Comput. Sci. 357 (1-3) (2006)
Helmut Schwichtenberg
A Direct Proof of the Equivalence between Brouwer's Fan Theorem and König's Lemma with a Uniqueness Hypothesis. J. Univers. Comput. Sci. 11 (12) (2005)
Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg
An arithmetic for non-size-increasing polynomial-time computation. Theor. Comput. Sci. 318 (1-2) (2004)
Helmut Schwichtenberg
Proof Search in Minimal Logic. AISC (2004)
Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg
Term rewriting for normalization by evaluation. Inf. Comput. 183 (1) (2003)
Klaus Aehlig, Helmut Schwichtenberg
A syntactical analysis of non-size-increasing polynomial time computation. ACM Trans. Comput. Log. 3 (3) (2002)
Ulrich Berger, Wilfried Buchholz, Helmut Schwichtenberg
Refined program extraction form classical proofs. Ann. Pure Appl. Log. 114 (1-3) (2002)
Ulrich Berger, Helmut Schwichtenberg, Monika Seisenberger
The Warshall Algorithm and Dickson's Lemma: Two Examples of Realistic Program Extraction. J. Autom. Reason. 26 (2) (2001)
Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn
Linear Ramified Higher Type Recursion and Parallel Complexity. Proof Theory in Computer Science (2001)
Klaus Aehlig, Helmut Schwichtenberg
A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation. LICS (2000)
Klaus Aehlig, Helmut Schwichtenberg
A syntactical analysis of non-size-increasing polynomial time computation CoRR (2000)
Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Schwichtenberg
Higher type recursion, ramification and polynomial time. Ann. Pure Appl. Log. 104 (1-3) (2000)
Helmut Schwichtenberg
Termination of Permutative Conversions in Intuitionistic Gentzen Calculi. Theor. Comput. Sci. 212 (1-2) (1999)
Helmut Schwichtenberg
Monotone Majorizable Functionals. Stud Logica 62 (2) (1999)
Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg
Normalisation by Evaluation. Prospects for Hardware Foundations (1998)
Helmut Schwichtenberg
Finite Notations for Infinite Terms. Ann. Pure Appl. Log. 94 (1-3) (1998)
Jaco van de Pol, Helmut Schwichtenberg
Strict Functionals for Termination Proofs. TLCA (1995)
Ulrich Berger, Helmut Schwichtenberg
The Greatest Common Divisor: A Case Study for Program Extraction from Classical Proofs. TYPES (1995)
Ulrich Berger, Helmut Schwichtenberg
Program Extraction from Classical Proofs. LCC (1994)
Helmut Schwichtenberg
An upper bound for reduction sequences in the typed λ-calculus. Arch. Math. Log. 30 (5-6) (1991)
Ulrich Berger, Helmut Schwichtenberg
An Inverse of the Evaluation Functional for Typed lambda-calculus LICS (1991)
Helmut Schwichtenberg
Minimal from Classical Proofs. CSL (1991)
Helmut Schwichtenberg
Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen. Computation Theory and Logic (1987)
Helmut Schwichtenberg
On Bar Recursion of Types 0 and 1. J. Symb. Log. 44 (3) (1979)
Helmut Schwichtenberg
-Kalkül mit Typen. Arch. Math. Log. 17 (3-4) (1975)