Difference between revisions of "Lambda calculus"
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
[[wikipedia:Lambda calculus|Lambda calculus]] is a formal language that can serve as a foundation of all general purpose programming languages. It is also a kind of [[Universal Data Abstraction]]. Essentially, a lambda calculus is a recursively defined dictionary with just three branches of possible values. | [[wikipedia:Lambda calculus|Lambda calculus]] is a formal language that can serve as a foundation of all general purpose programming languages. It is also a kind of [[Universal Data Abstraction]]. Essentially, a lambda calculus is a recursively defined dictionary with just three branches of possible values. | ||
{| class="wikitable" | |||
|- | |||
! Syntax !! Name !! Description | |||
|- | |||
| ''x'' || Variable || A character or string representing a parameter or mathematical/logical value. | |||
|- | |||
| (λ''x''.''M'') || Abstraction || Function definition (''M'' is a lambda term). The variable ''x'' becomes [[Free variables and bound variables|bound]] in the expression. | |||
|- | |||
| (''M'' ''N'') || Application || Applying a function to an argument. ''M'' and ''N'' are lambda terms. | |||
|} | |||
A nice tutorial can be found here<ref>{{:Video/Lambda Calculus - Computerphile}}</ref>. | A nice tutorial can be found here<ref>{{:Video/Lambda Calculus - Computerphile}}</ref>. | ||
Revision as of 18:50, 12 May 2022
Lambda calculus is a formal language that can serve as a foundation of all general purpose programming languages. It is also a kind of Universal Data Abstraction. Essentially, a lambda calculus is a recursively defined dictionary with just three branches of possible values.
| Syntax | Name | Description |
|---|---|---|
| x | Variable | A character or string representing a parameter or mathematical/logical value. |
| (λx.M) | Abstraction | Function definition (M is a lambda term). The variable x becomes bound in the expression. |
| (M N) | Application | Applying a function to an argument. M and N are lambda terms. |
A nice tutorial can be found here[1].
References
- ↑ Graham, Hutton (January 28, 2017). Lambda Calculus - Computerphile. local page: Computerphile.