Journal of Symbolic Logic 66 (3):1277-1285 (2001)
| Abstract |
We determine the exact bounds for the length of an arbitrary reduction sequence of a term in the typed λ-calculus with β-, ξ- and η-conversion. There will be two essentially different classifications, one depending on the height and the degree of the term and the other depending on the length and the degree of the term
|
| Keywords | No keywords specified (fix it) |
| Categories | (categorize this paper) |
| DOI | 10.2307/2695106 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
PhilArchive copy
Upload a copy of this paper Check publisher's policy Papers currently archived: 58,256
External links
- From the Publisher via CrossRef (no proxy)
- projecteuclid.org
(no proxy) - projecteuclid.org [2] (no proxy)
- jstor.org (no proxy)
- jstor.org [2] (no proxy)
- jstor.org [3] (no proxy)
- cambridge.org (no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
- Sign in / register and customize your OpenURL resolver..
- Configure custom resolver
References found in this work BETA
An Upper Bound for Reduction Sequences in the Typed Λ-Calculus.Helmut Schwichtenberg - 1991 - Archive for Mathematical Logic 30 (5-6):405-408.
The Lambda Calculus. Its Syntax and Semantics.E. Engeler - 1984 - Journal of Symbolic Logic 49 (1):301-303.
Citations of this work BETA
Elementary Proof of Strong Normalization for Atomic F.Fernando Ferreira & Gilda Ferreira - 2016 - Bulletin of the Section of Logic 45 (1):1-15.
Extracting Herbrand Disjunctions by Functional Interpretation.Philipp Gerhardy & Ulrich Kohlenbach - 2005 - Archive for Mathematical Logic 44 (5):633-644.
Analyzing Godel's T Via Expanded Head Reduction Trees.Arnold Beckmann & Andreas Weiermann - 2000 - Mathematical Logic Quarterly 46 (4):517-536.
On the Computational Complexity of Cut-Reduction.Klaus Aehlig & Arnold Beckmann - 2010 - Annals of Pure and Applied Logic 161 (6):711-736.
Continuous Normalization for the Lambda-Calculus and Gödel’s T.Klaus Aehlig & Felix Joachimski - 2005 - Annals of Pure and Applied Logic 133 (1-3):39-71.
View all 9 citations / Add more citations
Similar books and articles
The Deduction Rule and Linear and Near-Linear Proof Simulations.Maria Luisa Bonet & Samuel R. Buss - 1993 - Journal of Symbolic Logic 58 (2):688-709.
On Proof Terms and Embeddings of Classical Substructural Logics.Ken-Etsu Fujita - 1998 - Studia Logica 61 (2):199-221.
Explicit Provability and Constructive Semantics.Sergei N. Artemov - 2001 - Bulletin of Symbolic Logic 7 (1):1-36.
Lambda Calculus and Intuitionistic Linear Logic.Simona Ronchi della Rocca & Luca Roversi - 1997 - Studia Logica 59 (3):417-448.
An Application of Graphical Enumeration to PA.Andreas Weiermann - 2003 - Journal of Symbolic Logic 68 (1):5-16.
More About Uniform Upper Bounds on Ideals of Turing Degrees.Harold T. Hodes - 1983 - Journal of Symbolic Logic 48 (2):441-457.
Analytics
Added to PP index
2009-01-28
Total views
55 ( #183,729 of 2,419,706 )
Recent downloads (6 months)
4 ( #191,897 of 2,419,706 )
2009-01-28
Total views
55 ( #183,729 of 2,419,706 )
Recent downloads (6 months)
4 ( #191,897 of 2,419,706 )
How can I increase my downloads?
Downloads
