论文信息 - The Typed lambda-Calculus is not Elementary Recursive - 字舞流文

The Typed lambda-Calculus is not Elementary Recursive

We prove that the problem of deciding for closed terms t1, t2 of the typed λ-calculus whether t1 β-converts to t2 is not elementary recursive.

Richard Statman | R. Statman

[1] W. Tait. A realizability interpretation of the theory of species , 1975 .

[2] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[3] Richard Montague,et al. The Proper Treatment of Quantification in Ordinary English , 1973 .

[4] A. Grzegorczyk. Some classes of recursive functions , 1964 .

[5] H. Läuchli. An Abstract Notion of Realizability for Which Intuitionistic Predicate Calculus is Complete , 1970 .

[6] H. Friedman. Equality between functionals , 1975 .

[7] George Stephen Boolos. On Kalmar's consistency proof and a generalization of the notion of ω-consistency , 1975, Arch. Math. Log..

[8] Rasmus Lerdorf,et al. Introduction to combinatory logic , 1972 .

[9] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[10] A. Church. The calculi of lambda-conversion , 1941 .

[11] Robin Milner,et al. Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..

[12] C. R. Mann. The Connection between Equivalence of Proofs and Cartesian Closed Categories , 1975 .

[13] Richard Statman,et al. Intuitionistic Propositional Logic is Polynomial-Space Complete , 1979, Theor. Comput. Sci..

[14] L. Henkin. A theory of prepositional types , 1963 .

[15] Gérard P. Huet,et al. A Unification Algorithm for Typed lambda-Calculus , 1975, Theor. Comput. Sci..