论文信息 - On Statman's Finite Completeness Theorem

On Statman's Finite Completeness Theorem

Abstract : We give a complete self-contained proof of Statman's finite completeness theorem and of a corollary of this theorem stating that the Lambda- definability conjecture implies the higher-order matching conjecture.

Richard Statman | Gilles Dowek

[1] David A. Wolfram,et al. The Clausal Theory of Types , 1993 .

[2] H. Friedman,et al. Harvey Friedman's Research on the Foundations of Mathematics , 1985 .

[3] R. Statman. Equality between Functionals Revisited , 1985 .

[4] J. Roger Hindley,et al. To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism , 1980 .

[5] Richard Statman,et al. Completeness, invariance and λ-definability , 1982, Journal of Symbolic Logic.

[6] Leon Henkin,et al. Completeness in the theory of types , 1950, Journal of Symbolic Logic.

[7] R. Statman,et al. On the Existence of Closed Terms in the Typed lambda Calculus II: Transformations of Unification Problems , 1981, Theor. Comput. Sci..

[8] J. Roger Hindley,et al. Introduction to combinators and λ-calculus , 1986, Acta Applicandae Mathematicae.

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