Helmut Schwichtenberg

45 papers A* 2B 4C 1Misc 1Journal 26Unranked 6

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Constructive aspects of Riemann's permutation theorem for series. Log. J. IGPL Josef Berger, Douglas S. Bridges, Hannes Diener, Helmut Schwichtenberg
2023	J	`jnl`	Lookahead analysis in exact real arithmetic with logical methods. Theor. Comput. Sci. Nils Köpp, Helmut Schwichtenberg
2021	J	`jnl`	Logic for exact real arithmetic. Log. Methods Comput. Sci. Helmut Schwichtenberg, Franziskus Wiesnet
2017	J	`jnl`	A bound for Dickson's lemma. Log. Methods Comput. Sci. Josef Berger, Helmut Schwichtenberg
2016	J	`jnl`	Editorial. FLAP Hannes Leitgeb, Iosif Petrakis, Peter Schuster, Helmut Schwichtenberg
2016	J	`jnl`	Embedding classical in minimal implicational logic. Math. Log. Q. Hajime Ishihara, Helmut Schwichtenberg
2015	J	`jnl`	Program extraction in exact real arithmetic. Math. Struct. Comput. Sci. Kenji Miyamoto, Helmut Schwichtenberg
2013	J	`jnl`	Minimal from classical proofs. Ann. Pure Appl. Log. Helmut Schwichtenberg, Christoph Senjak
2013	B	`conf`	Program Extraction from Nested Definitions. ITP Kenji Miyamoto, Fredrik Nordvall Forsberg, Helmut Schwichtenberg
2012	—	`book`	Proofs and Computations. Helmut Schwichtenberg, Stanley S. Wainer
2011	B	`conf`	Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras. CALCO Ulrich Berger, Kenji Miyamoto, Helmut Schwichtenberg, Monika Seisenberger
2008	J	`jnl`	Dialectica interpretation of well-founded induction. Math. Log. Q. Helmut Schwichtenberg
2008	J	`jnl`	Realizability interpretation of proofs in constructive analysis. Theory Comput. Syst. Helmut Schwichtenberg
2006	J	`jnl`	An arithmetic for polynomial-time computation. Theor. Comput. Sci. Helmut Schwichtenberg
2006	C	`conf`	Inverting Monotone Continuous Functions in Constructive Analysis. CiE Helmut Schwichtenberg
2006	—	`ch.`	Minlog. The Seventeen Provers of the World Helmut Schwichtenberg
2006	J	`jnl`	Program Extraction from Normalization Proofs. Stud Logica Ulrich Berger, Stefan Berghofer, Pierre Letouzey, Helmut Schwichtenberg
2005	J	`jnl`	A Direct Proof of the Equivalence between Brouwer's Fan Theorem and König's Lemma with a Uniqueness Hypothesis. J. Univers. Comput. Sci. Helmut Schwichtenberg
2004	J	`jnl`	An arithmetic for non-size-increasing polynomial-time computation. Theor. Comput. Sci. Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg
2004	Misc	`conf`	Proof Search in Minimal Logic. AISC Helmut Schwichtenberg
2003	J	`jnl`	Term rewriting for normalization by evaluation. Inf. Comput. Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg
2002	J	`jnl`	A syntactical analysis of non-size-increasing polynomial time computation. ACM Trans. Comput. Log. Klaus Aehlig, Helmut Schwichtenberg
2002	J	`jnl`	Refined program extraction form classical proofs. Ann. Pure Appl. Log. Ulrich Berger, Wilfried Buchholz, Helmut Schwichtenberg
2001	—	`conf`	Linear Ramified Higher Type Recursion and Parallel Complexity. Proof Theory in Computer Science Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn
2001	J	`jnl`	The Warshall Algorithm and Dickson's Lemma: Two Examples of Realistic Program Extraction. J. Autom. Reason. Ulrich Berger, Helmut Schwichtenberg, Monika Seisenberger
2000	A*	`conf`	A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation. LICS Klaus Aehlig, Helmut Schwichtenberg
2000	J	`jnl`	A syntactical analysis of non-size-increasing polynomial time computation CoRR Klaus Aehlig, Helmut Schwichtenberg
2000	—	`book`	Basic proof theory, Second Edition. Anne Sjerp Troelstra, Helmut Schwichtenberg
2000	B	`ed.`	Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau, Germany, August 21-26, 2000, Proceedings CSL Peter Clote, Helmut Schwichtenberg
2000	J	`jnl`	Higher type recursion, ramification and polynomial time. Ann. Pure Appl. Log. Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Schwichtenberg
1999	—	`ch.`	Classifying Recursive Functions. Handbook of Computability Theory Helmut Schwichtenberg
1999	J	`jnl`	Monotone Majorizable Functionals. Stud Logica Helmut Schwichtenberg
1999	J	`jnl`	Termination of Permutative Conversions in Intuitionistic Gentzen Calculi. Theor. Comput. Sci. Helmut Schwichtenberg
1998	J	`jnl`	Finite Notations for Infinite Terms. Ann. Pure Appl. Log. Helmut Schwichtenberg
1998	—	`conf`	Normalisation by Evaluation. Prospects for Hardware Foundations Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg
1996	—	`book`	Basic proof theory. Anne Sjerp Troelstra, Helmut Schwichtenberg
1995	—	`conf`	Strict Functionals for Termination Proofs. TLCA Jaco van de Pol, Helmut Schwichtenberg
1995	—	`conf`	The Greatest Common Divisor: A Case Study for Program Extraction from Classical Proofs. TYPES Ulrich Berger, Helmut Schwichtenberg
1994	—	`conf`	Program Extraction from Classical Proofs. LCC Ulrich Berger, Helmut Schwichtenberg
1991	A*	`conf`	An Inverse of the Evaluation Functional for Typed lambda-calculus LICS Ulrich Berger, Helmut Schwichtenberg
1991	J	`jnl`	An upper bound for reduction sequences in the typed λ-calculus. Arch. Math. Log. Helmut Schwichtenberg
1991	B	`conf`	Minimal from Classical Proofs. CSL Helmut Schwichtenberg
1987	—	`conf`	Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen. Computation Theory and Logic Helmut Schwichtenberg
1979	J	`jnl`	On Bar Recursion of Types 0 and 1. J. Symb. Log. Helmut Schwichtenberg
1975	J	`jnl`	Definierbare Funktionen im Arch. Math. Log. Helmut Schwichtenberg