In this note we shall try to place Friedman's remarkable little paper ([3]) in the context of what we know today about the model theory of the typed λ-calculus. In order to do this, it is appropriate to survey recent work in this area, in so far as it touches on issues raised by Friedman. We don't intend a general survey; much will be left out. In particular, we shall omit discussion of unification, fragments of L.C.F., and polymorphic types, which are areas of interest to the author, and the specialist will surely find other omissions. However, we will try to show the reader how Friedman's paper lays the foundation for the general model theory of the typed λ-calculus. The plan of this note is the following. We shall begin by a brief, informal introduction to the subject. The reader is then advised to read Friedman's paper. It is, after all, quite accessible and easy to read. We shall then proceed to consider the three major issues touched on in “Equality between functionals” as we view them today. These issues are (1) completeness theorems, (2) the solvability of higher type functional equations, and (3) logical relations.
[1]
H. Friedman.
Equality between functionals
,
1975
.
[2]
Peter B. Andrews.
Resolution in type theory
,
1971,
Journal of Symbolic Logic.
[3]
Richard Statman,et al.
Completeness, invariance and λ-definability
,
1982,
Journal of Symbolic Logic.
[4]
S. C. Kleene,et al.
Recursive functionals and quantifiers of finite types. II
,
1959
.
[5]
William W. Tait,et al.
Intensional interpretations of functionals of finite type I
,
1967,
Journal of Symbolic Logic.
[6]
Von Kurt Gödel,et al.
ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
,
1958
.
[7]
Richard Statman,et al.
The Typed lambda-Calculus is not Elementary Recursive
,
1979,
Theor. Comput. Sci..
[8]
Richard Statman.
Solving functional equations at higher types: some examples and some theorems
,
1986,
Notre Dame J. Formal Log..