Lambda Calculus: Then and Now
Dana Scott (CMU and Berkeley)
November 9th (Friday), 5PM, 716 Philosophy Hall, Columbia University
Abstract. A very fast development in the early 1930’s following Hilbert’s codification of Mathematical Logic led to the Incompleteness Theorems, Computable Functions, Undecidability Theorems, and the general formulation of Recursive Function Theory. The so called Lambda Calculus played a key role. The history of these developments will be traced, and the much later place of Lambda Calculus in Mathematics and Programming Language Theory will be outlined.