Highlights of the History of the Lambda-Calculus.

Abstract
This is an account of not only the lambda-calculus but of its close relative, the combinatory calculus. It begins with an introductory survey, so that no previous knowledge is required. It is explained why these are of such importance for computer software. The account is brought up to the present time. It includes the shortest and simplest proof of the Church-Rosser theorem, which is not yet published and appeared in a limited printing in August 1982. It includes a model of the combinatory calculus, also not yet published but available in 1982 in a limited printing. An introduction is given to some revolutionary new developments of the combinatory calculus for programming computers. (Author)

This publication has 0 references indexed in Scilit: