Explore over 5,214,755 papers,
46,254 were added last week.
Author
|
Conference
|
Journal
|
Year
Look for results that meet for the following criteria:
Later than
Equal to
Earlier than
Papers
Authors
Conferences
Journals
View Top Co-Authors In
Visual Explorer
Helmut Schwichtenberg
Top Co-Authors:
Ulrich Berger (20)
Klaus Aehlig (6)
Matthias Eberl (4)
Stephen J. Bellantoni (3)
Wilfried Buchholz (3)
Monika Seisenberger (3)
Stefan Berghofer (2)
Karl-heinz Niggl (2)
Pierre Letouzey (2)
Martin Hofmann (1)
Peter Schuster (1)
John V. Tucker (1)
Jaco Van De Pol (1)
Sebastiaan Terwijn (1)
Anne Sjerp Troelstra (1)
Jan Johannsen (1)
Name Name Book Title (1)
Karl A. Stroetmann (1)
Note However That Collier (1)
M. Eberl (1)
ObjectID : Author/855459
Helmut Schwichtenberg
(
Publications: 61
)
(
Citation Count: 418
)
(
G-Index: 19
)
(
H-Index: 11
)
HomePage
Theresienstrae 39 , D-80333 Munchen
Mathematisches Institut, Universität München, Theresienstraße 39, 80333, München, Germany
Permanent Link:
http://academic.research.microsoft.com/Author/855459.aspx
Order by:
Year
|
Citation
|
Rank
The rank of a paper is calculated by considering the authors, the published conference or journal, and its citation graph. The highest ranking result will appear first.
Learn more
Papers
Citations
Year 2008
Helmut Schwichtenberg
:
Dialectica interpretation of well-founded induction
,
MLQ
, 2008
(
Citations: 2
)
Helmut Schwichtenberg
:
Realizability interpretation of proofs in constructive analysis
,
MST
, 2008
(
Citations: 2
)
Year 2006
Ulrich Berger
,
Stefan Berghofer
,
Pierre Letouzey
,
Helmut Schwichtenberg
:
Program Extraction from Normalization Proofs
,
SLOGICA
, 2006
(
Citations: 7
)
Helmut Schwichtenberg
:
An arithmetic for polynomial-time computation
,
TCS
, 2006
(
Citations: 1
)
Helmut Schwichtenberg
:
Inverting Monotone Continuous Functions in Constructive Analysis
,
CIE
, 2006
Year 2005
U. Berger
,
S. Berghofer
,
P. Letouzey
,
H. Schwichtenberg
:
Program extraction from normalization proofs
, 2005
(
Citations: 9
)
Helmut Schwichtenberg
:
A Direct Proof of the Equivalence between Brouwer's Fan Theorem and König's Lemma with a Uniqueness Hypothesis
,
JUCS
, 2005
(
Citations: 1
)
Year 2004
Klaus Aehlig
,
Ulrich Berger
,
Martin Hofmann
,
Helmut Schwichtenberg
:
An arithmetic for non-size-increasing polynomial-time computation
,
TCS
, 2004
(
Citations: 3
)
Helmut Schwichtenberg
:
Proof Search in Minimal Logic
,
AISC
, 2004
(
Citations: 1
)
Year 2003
Ulrich Berger
,
Matthias Eberl
,
Helmut Schwichtenberg
:
Term rewriting for normalization by evaluation
,
IANDC
, 2003
(
Citations: 10
)
Peter Schuster
,
Helmut Schwichtenberg
:
Constructive Solutions of Continuous Equations
, 2003
(
Citations: 1
)
Year 2002
Ulrich Berger
,
Wilfried Buchholz
,
Helmut Schwichtenberg
:
Refined program extraction form classical proofs
,
APAL
, 2002
(
Citations: 28
)
Helmut Schwichtenberg
,
Stephen J. Bellantoni
:
Feasible Computation With Higher Types
, 2002
(
Citations: 5
)
Klaus Aehlig
,
Helmut Schwichtenberg
:
A syntactical analysis of non-size-increasing polynomial time computation
,
TOCL
, 2002
(
Citations: 3
)
Helmut Schwichtenberg
:
An Arithmetic for Polynomial-Time Computation
, 2002
Helmut Schwichtenberg
:
Program Extraction from Proofs
, 2002
Year 2001
Ulrich Berger
,
Helmut Schwichtenberg
,
Monika Seisenberger
:
The Warshall Algorithm and Dickson?s Lemma: Two Examples of Realistic Program Extraction
,
JAR
, 2001
(
Citations: 15
)
Ulrich Berger
,
Wilfried Buchholz
,
Helmut Schwichtenberg
:
Refined Program Extraction from Classical Proofs
, 2001
(
Citations: 4
)
Klaus Aehlig
,
Jan Johannsen
,
Helmut Schwichtenberg
,
Sebastiaan Terwijn
:
Linear Ramified Higher Type Recursion and Parallel Complexity
,
Dagstuhl Seminars
, 2001
(
Citations: 2
)
Klaus Aehlig
,
Helmut Schwichtenberg
:
A syntactical analysis of non-size-increasing poly-nomial time computation
, 2001
(
Citations: 4
)
Ulrich Berger Matthias Eberl
,
Helmut Schwichtenberg
:
Term Rewriting for Normalization By Evaluation
, 2001
Year 2000
Stephen J. Bellantoni
,
Karl-heinz Niggl
,
Helmut Schwichtenberg
:
Higher type recursion, ramification and polynomial time
,
APAL
, 2000
(
Citations: 23
)
Klaus Aehlig
,
Helmut Schwichtenberg
:
A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation
,
LICS
, 2000
(
Citations: 12
)
Ulrich Berger
,
Wilfried Buchholz
,
Helmut Schwichtenberg
:
Refined Program Extraction from Classical Proofs
, 2000
(
Citations: 4
)
Klaus Aehlig
,
Helmut Schwichtenberg
:
A symtactical amalysis of mom-size-imcreasimg polymomial time computatiom
, 2000
(
Citations: 1
)
Holger Benl
,
Ulrich Berger
,
Helmut Schwichtenberg
:
Normalization for Simultaneous Free Algebras
, 2000
Helmut Schwichtenberg
:
Feasible Programs From Proofs
, 2000
Year 1999
Helmut Schwichtenberg
:
Termination of Permutative Conversions in Intuitionistic Gentzen Calculi
,
TCS
, 1999
(
Citations: 20
)
Ulrich Berger
,
Helmut Schwichtenberg
,
Monika Seisenberger
:
The Warshall Algorithm and Dickson's Lemma: Two Examples of realistic program extraction
, 1999
(
Citations: 7
)
Helmut Schwichtenberg
:
Refined Program Extraction from Classical Proofs: Some Case Studies
, 1999
(
Citations: 2
)
Ulrich Berger
,
Matthias Eberl
,
Helmut Schwichtenberg
:
Term Rewriting for Normalization by Evaluation
, 1999
(
Citations: 2
)
Helmut Schwichtenberg
:
Monotone Majorizable Functionals
,
SLOGICA
, 1999
(
Citations: 2
)
H. Schwichtenberg
,
K. H Niggl
,
S. Bellantoni
:
Higher Type Recursion, Ramification and Polynomial Time
, 1999
(
Citations: 1
)
Year 1998
Ulrich Berger
,
Matthias Eberl
,
Helmut Schwichtenberg
:
Normalisation by Evaluation
,
New Hardware Design Methods
, 1998
(
Citations: 29
)
Helmut Schwichtenberg
:
Finite Notations for Infinite Terms
,
APAL
, 1998
(
Citations: 1
)
U. Berger
,
M. Eberl
,
H. Schwichtenberg
,
J. V. Tucker
:
Volume 1546 of LNCS
, 1998
Year 1997
Helmut Schwichtenberg
:
Termination of permutative conversions in intuitionistic Gentzen calculi
, 1997
(
Citations: 15
)
Helmut Schwichtenberg
:
Minlog - An Interactive Prover
, 1997
Year 1996
Helmut Schwichtenberg
:
Density and Choice for Total Continuous Functionals
, 1996
(
Citations: 8
)
U. Berger
,
H. Schwichtenberg
:
The Greatest Common Divisor: A Case Study for Program Extraction From Classical Proofs
, 1996
(
Citations: 3
)
A. S. Troelstra
,
H. Schwichtenberg
:
Number 43 in Cambridge Tracts in Theoretical Computer Science
, 1996
(
Citations: 1
)
Year 1995
Jaco Van De Pol
,
Helmut Schwichtenberg
:
Strict Functionals for Termination Proofs
,
TLCA
, 1995
(
Citations: 26
)
U. Berger
,
H. Schwichtenberg
:
Program Extraction from Classical Proofs
, 1995
(
Citations: 25
)
Helmut Schwichtenberg
:
Proofs, Lambda Terms and Control Operators
, 1995
(
Citations: 2
)
Ulrich Berger
,
Helmut Schwichtenberg
:
The Greatest Common Divisor: A Case Study for Program Extraction from Classical Proofs
,
Types for Proofs and Programs
, 1995
(
Citations: 1
)
Year 1994
Ulrich Berger
,
Helmut Schwichtenberg
:
Program Extraction from Classical Proofs
,
LCC
, 1994
(
Citations: 5
)
Year 1991
Ulrich Berger
,
Helmut Schwichtenberg
:
An Inverse of the Evaluation Functional for Typed lambda-calculus
,
LICS
, 1991
(
Citations: 64
)
U. Berger
,
H. Schwichtenberg
:
An inverse of the evalu-ation functional for typed-calculus
, 1991
(
Citations: 51
)
Helmut Schwichtenberg
:
Minimal from Classical Proofs
,
CSL
, 1991
Year 1987
Helmut Schwichtenberg
:
Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen
,
Birthday ...
, 1987
Year 1979
Helmut Schwichtenberg
:
On Bar Recursion of Types 0 and 1
,
JSYML
, 1979
(
Citations: 6
)
Year Unknown
Helmut Schwichtenberg
,
If Rule
,
Variable Rule. If
,
Cut Rule. If
,
Note That
,
A Uniquely
,
Rule. Hence The Generation
,
Variable Lemma. If Lev
,
Y The
,
Substitution Lemma. If
,
Yj And Lev
,
Proof. Induction On
,
Mr. We Writet
,
Rule. Induction Hypothesis
:
An upper bound for reduction sequences in the typed �–calculus.
(
Citations: 3
)
Helmut Schwichtenberg
:
Recursion on the partial continuous functionals
(
Citations: 2
)
Helmut Schwichtenberg
:
Constructive Analysis with Witnesses
(
Citations: 2
)
Helmut Schwichtenberg
:
Program Extraction in Constructive Analysis
(
Citations: 1
)
Helmut Schwichtenberg
:
Classical Proofs and Programs
(
Citations: 1
)
Helmut Schwichtenberg
,
Natural Deduction Rules For
,
8
:
Extracting computational content from proofs
Ulrich Berger
,
Helmut Schwichtenberg
,
Monika Seisenberger
:
From Proofs to Programs in the Minlog System - The Warshall Algorithm and Higman's Lemma
Book Title
,
Dominik Schlenker
,
Helmut Schwichtenberg
:
Machine Extraction of the Normalization-by-Evaluation Algorithm from a Normalization Proof
Helmut Schwichtenberg
,
Karl Stroetmann
:
From Higher Order Terms To Circuits
Helmut Schwichtenberg
:
NEW DEVELOPMENTS IN PROOFS AND COMPUTATIONS