Helmut Schwichtenberg

According to our database, Helmut Schwichtenberg authored at least 41 papers between 1975 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Lookahead analysis in exact real arithmetic with logical methods.

Nils Köpp, Helmut Schwichtenberg

Theor. Comput. Sci., 2023

2021

Logic for exact real arithmetic.

Helmut Schwichtenberg, Franziskus Wiesnet

Log. Methods Comput. Sci., 2021

2017

A bound for Dickson's lemma.

Josef Berger, Helmut Schwichtenberg

Log. Methods Comput. Sci., 2017

2016

Embedding classical in minimal implicational logic.

Hajime Ishihara, Helmut Schwichtenberg

Math. Log. Q., 2016

Editorial.

Hannes Leitgeb, Iosif Petrakis, Peter Schuster, Helmut Schwichtenberg

FLAP, 2016

2015

Program extraction in exact real arithmetic.

Kenji Miyamoto, Helmut Schwichtenberg

Math. Struct. Comput. Sci., 2015

2013

Minimal from classical proofs.

Helmut Schwichtenberg, Christoph Senjak

Ann. Pure Appl. Log., 2013

Program Extraction from Nested Definitions.

Kenji Miyamoto, Fredrik Nordvall Forsberg, Helmut Schwichtenberg

Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

2012

Proofs and Computations.

Helmut Schwichtenberg, Stanley S. Wainer

Perspectives in logic, Association for Symbolic Logic, ISBN: 978-0-521-51769-0, 2012

2011

Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras.

Ulrich Berger, Kenji Miyamoto, Helmut Schwichtenberg, Monika Seisenberger

Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2008

Realizability interpretation of proofs in constructive analysis.

Helmut Schwichtenberg

Theory Comput. Syst., 2008

Dialectica interpretation of well-founded induction.

Helmut Schwichtenberg

Math. Log. Q., 2008

2006

An arithmetic for polynomial-time computation.

Helmut Schwichtenberg

Theor. Comput. Sci., 2006

Program Extraction from Normalization Proofs.

Ulrich Berger, Stefan Berghofer, Pierre Letouzey, Helmut Schwichtenberg

Stud Logica, 2006

Minlog.

Helmut Schwichtenberg

Proceedings of the Seventeen Provers of the World, Foreword by Dana S. Scott, 2006

Inverting Monotone Continuous Functions in Constructive Analysis.

Helmut Schwichtenberg

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

A Direct Proof of the Equivalence between Brouwer's Fan Theorem and König's Lemma with a Uniqueness Hypothesis.

Helmut Schwichtenberg

J. Univers. Comput. Sci., 2005

2004

An arithmetic for non-size-increasing polynomial-time computation.

Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg

Theor. Comput. Sci., 2004

Proof Search in Minimal Logic.

Helmut Schwichtenberg

Proceedings of the Artificial Intelligence and Symbolic Computation, 2004

2003

Term rewriting for normalization by evaluation.

Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg

Inf. Comput., 2003

2002

A syntactical analysis of non-size-increasing polynomial time computation.

Klaus Aehlig, Helmut Schwichtenberg

ACM Trans. Comput. Log., 2002

Refined program extraction form classical proofs.

Ulrich Berger, Wilfried Buchholz, Helmut Schwichtenberg

Ann. Pure Appl. Log., 2002

2001

The Warshall Algorithm and Dickson's Lemma: Two Examples of Realistic Program Extraction.

Ulrich Berger, Helmut Schwichtenberg, Monika Seisenberger

J. Autom. Reason., 2001

Linear Ramified Higher Type Recursion and Parallel Complexity.

Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn

Proceedings of the Proof Theory in Computer Science, International Seminar, 2001

2000

Higher type recursion, ramification and polynomial time.

Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Schwichtenberg

Ann. Pure Appl. Log., 2000

Basic proof theory, Second Edition.

Anne Sjerp Troelstra, Helmut Schwichtenberg

Cambridge tracts in theoretical computer science 43, Cambridge University Press, ISBN: 978-0-521-77911-1, 2000

1999

Termination of Permutative Conversions in Intuitionistic Gentzen Calculi.

Helmut Schwichtenberg

Theor. Comput. Sci., 1999

Monotone Majorizable Functionals.

Helmut Schwichtenberg

Stud Logica, 1999

Classifying Recursive Functions.

Helmut Schwichtenberg

Proceedings of the Handbook of Computability Theory, 1999

1998

Finite Notations for Infinite Terms.

Helmut Schwichtenberg

Ann. Pure Appl. Log., 1998

Normalisation by Evaluation.

Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg

Proceedings of the Prospects for Hardware Foundations, ESPRIT Working Group 8533, NADA, 1998

1996

Basic proof theory.

Anne Sjerp Troelstra, Helmut Schwichtenberg

Cambridge tracts in theoretical computer science 43, Cambridge University Press, ISBN: 978-0-521-57223-1, 1996

1995

The Greatest Common Divisor: A Case Study for Program Extraction from Classical Proofs.

Ulrich Berger, Helmut Schwichtenberg

Proceedings of the Types for Proofs and Programs, 1995

Strict Functionals for Termination Proofs.

Jaco van de Pol, Helmut Schwichtenberg

Proceedings of the Typed Lambda Calculi and Applications, 1995

1994

Program Extraction from Classical Proofs.

Ulrich Berger, Helmut Schwichtenberg

Proceedings of the Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, 1994

1991

An upper bound for reduction sequences in the typed λ-calculus.

Helmut Schwichtenberg

Arch. Math. Log., 1991

An Inverse of the Evaluation Functional for Typed lambda-calculus

Ulrich Berger, Helmut Schwichtenberg

Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

Minimal from Classical Proofs.

Helmut Schwichtenberg

Proceedings of the Computer Science Logic, 5th Workshop, 1991

1987

Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen.

Helmut Schwichtenberg

Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1979

On Bar Recursion of Types 0 and 1.

Helmut Schwichtenberg

J. Symb. Log., 1979

1975

Definierbare Funktionen im<i>λ</i>-Kalkül mit Typen.

Helmut Schwichtenberg

Arch. Math. Log., 1975