Editing Lambda calculus (section)

== See also ==
{{Portal|Mathematics}}
{{Colbegin|colwidth=30em}}
* [[Applicative computing systems]] – Treatment of [[Object (computer science)|objects]] in the style of the lambda calculus
* [[Cartesian closed category]] – A setting for lambda calculus in [[category theory]]
* [[Categorical abstract machine]] – A [[model of computation]] applicable to lambda calculus
* [[Clojure]], programming language
* [[Curry–Howard isomorphism]] – The formal correspondence between programs and [[mathematical proof|proofs]]
* [[De Bruijn index]] – notation disambiguating alpha conversions
* [[De Bruijn notation]] – notation using postfix modification functions
* [[Domain theory]] – Study of certain [[partially ordered sets|posets]] giving [[denotational semantics]] for lambda calculus
* [[Evaluation strategy]] – Rules for the evaluation of expressions in [[programming language]]s
* [[Explicit substitution]] – The theory of substitution, as used in [[#β-reduction|β-reduction]]
* [[Harrop formula]] – A kind of constructive logical formula such that proofs are lambda terms
* [[Interaction nets]]
* [[Kleene–Rosser paradox]] – A demonstration that some form of lambda calculus is inconsistent
* [[Knights of the Lambda Calculus]] – A semi-fictional organization of LISP and [[Scheme (programming language)|Scheme]] [[Hacker (programmer subculture)|hackers]]
* [[Krivine machine]] – An abstract machine to interpret call-by-name in lambda calculus
* [[Lambda calculus definition]] – Formal definition of the lambda calculus.
* [[Let expression]] – An expression closely related to an abstraction.
* [[Minimalism (computing)]]
* [[Rewriting]] – Transformation of formulæ in formal systems
* [[SECD machine]] – A [[virtual machine]] designed for the lambda calculus
* [[Scott–Curry theorem]] – A theorem about sets of lambda terms
* ''[[To Mock a Mockingbird]]'' – An introduction to [[combinatory logic]]
* [[Universal Turing machine]] – A formal computing machine equivalent to lambda calculus
* [[Unlambda]] – A functional [[esoteric programming language]] based on combinatory logic
{{colend}}