Difference between revisions of "Lambda calculus"

Latest revision as of 14:15, 19 May 2022

Redirect to:

@@ 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.
+#REDIRECT [[Lambda Calculus]]
-{| 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.
-|}
-==Lambda Calculus expressed in Backus-Naur form==
-=Relevant Learning Material=
-A nice video<ref>{{:Video/Lambda Calculus - Computerphile}}</ref> tutorial by Hutton is available. An interactive web page to illustrate the working process of [[Lambda calculus]] can be found here: [https://opendsa-server.cs.vt.edu/OpenDSA/Books/PL/html/Syntax.html Syntax of the Lambda Calculus].
-<noinclude>
-=References=
-<references/>
-==Related Pages==
-[[Category:Programming Language]]
-</noinclude>