Helmut Schwichtenberg

According to our database1, Helmut Schwichtenberg authored at least 36 papers between 1975 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
A bound for Dickson's lemma.
Logical Methods in Computer Science, 2017

2016
Embedding classical in minimal implicational logic.
Math. Log. Q., 2016

Editorial.
FLAP, 2016

2015
Program extraction in exact real arithmetic.
Mathematical Structures in Computer Science, 2015

2013
Minimal from classical proofs.
Ann. Pure Appl. Logic, 2013

Program Extraction from Nested Definitions.
Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

2012
Proofs and Computations.
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.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2008
Realizability interpretation of proofs in constructive analysis.
Theory Comput. Syst., 2008

Dialectica interpretation of well-founded induction.
Math. Log. Q., 2008

2006
An arithmetic for polynomial-time computation.
Theor. Comput. Sci., 2006

Program Extraction from Normalization Proofs.
Studia Logica, 2006

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

Inverting Monotone Continuous Functions in Constructive Analysis.
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.
J. UCS, 2005

2004
An arithmetic for non-size-increasing polynomial-time computation.
Theor. Comput. Sci., 2004

Proof Search in Minimal Logic.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2004

2003
Term rewriting for normalization by evaluation.
Inf. Comput., 2003

2002
Refined program extraction form classical proofs.
Ann. Pure Appl. Logic, 2002

2001
The Warshall Algorithm and Dickson's Lemma: Two Examples of Realistic Program Extraction.
J. Autom. Reasoning, 2001

Linear Ramified Higher Type Recursion and Parallel Complexity.
Proceedings of the Proof Theory in Computer Science, International Seminar, 2001

2000
Higher type recursion, ramification and polynomial time.
Ann. Pure Appl. Logic, 2000

A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation.
Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

1999
Termination of Permutative Conversions in Intuitionistic Gentzen Calculi.
Theor. Comput. Sci., 1999

Monotone Majorizable Functionals.
Studia Logica, 1999

1998
Finite Notations for Infinite Terms.
Ann. Pure Appl. Logic, 1998

Normalisation by Evaluation.
Proceedings of the Prospects for Hardware Foundations, ESPRIT Working Group 8533, NADA, 1998

1995
The Greatest Common Divisor: A Case Study for Program Extraction from Classical Proofs.
Proceedings of the Types for Proofs and Programs, 1995

Strict Functionals for Termination Proofs.
Proceedings of the Typed Lambda Calculi and Applications, 1995

1994
Program Extraction from Classical Proofs.
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.
Arch. Math. Log., 1991

An Inverse of the Evaluation Functional for Typed lambda-calculus
Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

Minimal from Classical Proofs.
Proceedings of the Computer Science Logic, 5th Workshop, 1991

1987
Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen.
Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1979
On Bar Recursion of Types 0 and 1.
J. Symb. Log., 1979

1975
Definierbare Funktionen imλ-Kalkül mit Typen.
Arch. Math. Log., 1975


  Loading...