Access the full text.
Sign up today, get DeepDyve free for 14 days.
H. Barendregt (1985)
The Lambda Calculus: Its Syntax and Semantics
R. David (2001)
Normalization without reducibilityAnn. Pure Appl. Log., 107
(1996)
Academisch Proefschrift (PhD thesis)
(1995)
Forms a part of [vR96
H. Schwichtenberg (1993)
Proofs as programs
(1995)
S erie I:1401{1406
W. Howard (1980)
Ordinal analysis of terms of finite typeJournal of Symbolic Logic, 45
(2001)
Operational Aspects of Normalization by Evaluation
J. Pol, van de (1996)
Termination of higher-order rewrite systems, 16
(1997)
Basic Simple Type Theory, volume 42 of Cambridge Tracts in Theoretical Computer Science
(1980)
An early proof of normalization
A. Weiermann (1997)
A proof of strongly uniform termination for Gödel's $T$ by methods from local predicativityArchive for Mathematical Logic, 36
D. Prawitz (1971)
Ideas and Results in Proof TheoryStudies in logic and the foundations of mathematics, 63
Felix Joachimski (2001)
Reduction Properties of IE-Systems
H. Goguen (1995)
Typed Operational Semantics
Thorsten Altenkirch (1993)
A Formalization of the Strong Normalization Proof for System F in LEGO
W. Tait (1967)
Intensional interpretations of functionals of finite type IJournal of Symbolic Logic, 32
Program extra tion from normalization proofs
F. Raamsdonk, P. Severi, M. Heine, Bryan So (1999)
Perpetual Reductions in *-CalculusInforms Journal on Computing
F. Raamsdonk, P. Severi (1995)
On normalisation
R. David (1995)
Une preuve simple de résultats classiques en λ calcul, 320
We prove this assertion by induction on the generation of r ~ n 2 . Let for each case ~ s be xed
P. Groote (1999)
On the Strong Normalisation of Natural Deduction with Permutation-Conversions
K. Schütte (1977)
Proof theory
R. Matthes (1998)
Extensions of system F by iteration and primitive recursion on monotone inductive types
(1993)
Typed Lambda Calculi and Applications Lecture Notes in Computer Science
H. Goguen (1994)
A typed operational semantics for type theory
J. Girard (1975)
Review: W. W. Tait, Intensional Interpretations of Functionals of Finite Type IJournal of Symbolic Logic, 40
R. Matthes (2000)
Characterizing Strongly Normalizing Terms of a Calculus with Generalized Applications via Intersection Types
H. Goguen (1999)
Soundness of the Logical Framework for Its Typed Operational Semantics
J. Diller (1968)
Zur Berechenbarkeit Primitiv-Rekursiver Funktionale Endlicher TypenStudies in logic and the foundations of mathematics, 50
H. Schwichtenberg (1999)
Termination of Permutative Conversions in Intuitionistic Gentzen CalculiTheor. Comput. Sci., 212
D. Leivant (1975)
Strong normalization for arithmetic
F. Raamsdonk, P. Severi, M. Sørensen, H. Xi (1999)
Perpetual Reductions in Lambda-CalculusInf. Comput., 149
(1997)
-expansion in GG odel's T, pure type systems and calculi with permutative conversions. Unpublished draft. Available as http
V. Gödel (1958)
ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTESDialectica, 12
A. Troelstra (1973)
Metamathematical investigation of intuitionistic arithmetic and analysis
L. Sanchis (1967)
Functionals defined by recursionNotre Dame J. Formal Log., 8
W. Tait (1975)
A realizability interpretation of the theory of species
Value of a term in SN) By recursion on r N 2 SN we deene its
(1998)
Short proofs of standardisation for the simply-typed -calculus, permutative conversions and GG odel's T
F. Raamsdonk (1996)
Confluence and Normalisation of Higher-Order Rewriting
Case 0. 0(s; t) 2 is inferred from s; t 2 by the rule
J. Plato (2001)
Natural deduction with general elimination rulesArch. Math. Log., 40
Let r : N; s : ; t : N ! ! be in . In order to conclude r(s; t) 2 it suuces to show 8n:n(s; t) 2 . This is done by side induction on n
Inductive characterizations of the sets of terms, the subset of strongly normalizing terms and normal forms are studied in order to reprove weak and strong normalization for the simply-typed λ-calculus and for an extension by sum types with permutative conversions. The analogous treatment of a new system with generalized applications inspired by generalized elimination rules in natural deduction, advocated by von Plato, shows the flexibility of the approach which does not use the strong computability/candidate style à la Tait and Girard. It is also shown that the extension of the system with permutative conversions by η-rules is still strongly normalizing, and likewise for an extension of the system of generalized applications by a rule of ``immediate simplification''. By introducing an infinitely branching inductive rule the method even extends to Gödel's T.
Archive for Mathematical Logic – Springer Journals
Published: Jan 1, 2003
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.