The following pages link to Helmut Schwichtenberg (Q234585):
Displaying 50 items.
- Viewing \({\lambda}\)-terms through maps (Q740485) (← links)
- Reduction of higher type levels by means of an ordinal analysis of finite terms (Q759749) (← links)
- Program extraction from normalization proofs (Q817701) (← links)
- Realizability interpretation of proofs in constructive analysis (Q1015381) (← links)
- (Q1105576) (redirect page) (← links)
- Reflections on Church's thesis (Q1105577) (← links)
- Productive sets and constructively nonpartial-recursive functions (Q1105589) (← links)
- Equivalence of bar recursors in the theory of functionals of finite type (Q1115867) (← links)
- Recursive functionals (Q1202200) (← links)
- Termination of permutative conversions in intuitionistic Gentzen calculi (Q1275632) (← links)
- Monotone majorizable functionals (Q1288967) (← links)
- Finite notations for infinite terms (Q1295405) (← links)
- A proof of strongly uniform termination for Gödel's \(T\) by methods from local predicativity (Q1374676) (← links)
- Term rewriting for normalization by evaluation. (Q1401941) (← links)
- Higher type recursion, ramification and polynomial time (Q1577477) (← links)
- The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction (Q1595930) (← links)
- Effective choice functions and index sets (Q1820773) (← links)
- Which set existence axioms are needed to prove the separable Hahn-Banach theorem? (Q1820779) (← links)
- An arithmetic for non-size-increasing polynomial-time computation (Q1827388) (← links)
- Minimal from classical proofs (Q1946677) (← links)
- What is constructive mathematics? (Q2266012) (← links)
- An arithmetic for polynomial-time computation (Q2500489) (← links)
- An upper bound for reduction sequences in the typed \(\lambda\)-calculus (Q2639840) (← links)
- Lookahead analysis in exact real arithmetic with logical methods (Q2680994) (← links)
- Refined program extraction from classical proofs: Some case studies (Q2752052) (← links)
- Embedding classical in minimal implicational logic (Q2793912) (← links)
- (Q3001103) (← links)
- (Q3024848) (← links)
- (Q3081644) (← links)
- Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras (Q3090883) (← links)
- Proofs and Computations (Q3110202) (← links)
- (Q3138828) (← links)
- Higman’s Lemma and Its Computational Content (Q3305561) (← links)
- Program Extraction from Proofs: The Fan Theorem for Uniformly Coconvex Bars (Q3305639) (← links)
- (Q3322086) (← links)
- (Q3322097) (← links)
- Dialectica interpretation of well-founded induction (Q3506320) (← links)
- Program Extraction in Constructive Analysis (Q3613309) (← links)
- (Q3801545) (← links)
- On bar recursion of types 0 and 1 (Q3870893) (← links)
- (Q3874169) (← links)
- (Q4079601) (← links)
- Definierbare Funktionen imλ-Kalkül mit Typen (Q4094854) (← links)
- (Q4108311) (← links)
- (Q4202954) (← links)
- (Q4263834) (← links)
- (Q4309506) (← links)
- (Q4357067) (← links)
- (Q4395618) (← links)
- (Q4397033) (← links)
