## Lambda Calculus (1997)

by
C. -h. L. Ong

Citations: | 1 - 0 self |

### BibTeX

@MISC{Ong97lambdacalculus,

author = {C. -h. L. Ong},

title = {Lambda Calculus},

year = {1997}

}

### OpenURL

### Abstract

Recursive functions are representable as lambda terms, and de nability in the calculus may be regarded as a de nition of computability. This forms part of the standard foundations of computer science. Lambda calculus is the commonly accepted basis of functional programming languages; and it is folklore that the calculus is the prototypical functional language in puri ed form. The course investigates the syntax and semantics of lambda calculus both as a theory of functions from a foundational point of view, and as a minimal programming language.