The Lambda Calculus and Adjoint Functors
The well known lambda calculus was first formulated by Alonzo Church (1932). It was originally intended as a new foundation of mathematics; but soon the remarkable connection between lambda definability and recursive functions was developed. Only much later was the connection with rewrite systems noted, while the remarkable influence of the calculus in computer languages was also noted later. This note is to point out that the Galois connections and this lambda calculus are perhaps the first appearances of an explicit pair of adjoint functors. These functors in general were not found until the work of Daniel Kan in 1958.1
Unable to display preview. Download preview PDF.
- Church, A. 1936 Mathematical logic, Department of Mathematics, Princeton University, mimeographed notes (113 pages); reviewed in The Journal of Symbolic Logic, vol. 2, p. 39.Google Scholar
- Church, A. 1941 The calculi of lambda conversion, Princeton University Press, Princeton, New Jersey.Google Scholar
- Lambek, J., and P. J. Scott 1986 Introduction to higher order categorical logic, Cambridge University Press, Cambridge, England.Google Scholar
- Lawvere, F. W. 1970 Equality in Hyperdoctrines and comprehension scheme as an adjoint functor, Applications of categorical algebra, American Mathematical Society, Providence.Google Scholar
- Mac Lane, S., and I. Moerdijk 1993 Sheaves in geometry and logic, A first introduction to topos theory, Springer-Verlag, New York.Google Scholar