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]]. | [[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. | ||
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:49, 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.
A nice tutorial can be found here[1].
References
- ↑ Graham, Hutton (January 28, 2017). Lambda Calculus - Computerphile. local page: Computerphile.