Catalogue of Artificial Intelligence Techniques


Jump to: Top | Entry | References | Comments

View Maths as: Images | MathML

Lambda Calculus

Keywords: alpha conversion, beta reduction, terms

Categories: Knowledge Representation

Author(s): Alan Smaill

Various formal systems based on that invented by Church to formalise the properties of functions acting on arguments and being combined to form other functions. This involves `lambda-abstraction'. The function f given by:


can be written using lambda-abstraction as:

f = λx.x+1

so that:


Application is written as juxtaposition, e.g., fx for f(x) . Terms made up using application and lambda abstraction can be manipulated in various ways, e.g., rename bound variables (alpha conversion), and rewrite (λx.fx)a as fa

(beta reduction). Lambda calculus is the formalism that underlies Lisp.



Add Comment

No comments.