Category:Lambda calculus

The main article for this category is Lambda calculus.

Subcategories

This category has the following 3 subcategories, out of 3 total.

A

• ► Abstract machines‎ (1 P)
• ► Applicative computing systems‎ (5 P)

S

• ► Substitution (logic)‎ (3 P)

Pages in category "Lambda calculus"

The following 43 pages are in this category, out of 43 total. This list may not reflect recent changes (learn more).

Lambda calculus A Anonymous function Applicative computing systems Apply B B,C,K,W system Beta normal form Binary lambda calculus Böhm tree C Calculus of constructions Cartesian closed category Church encoding Church–Rosser theorem Combinatory logic Context change potential Currying

D De Bruijn index De Bruijn notation Director string Divergence (computer science) E Explicit substitution F Fixed-point combinator H Higher-order function Hindley–Milner K Kleene–Rosser paradox Knights of the Lambda Calculus L Lambda cube Lambda lifting Lambda-mu calculus M Mogensen–Scott encoding Montague grammar

N Normalisation by evaluation Normalization property (abstract rewriting) P Pattern calculus Pure type system R Rho calculus S Simply typed lambda calculus SKI combinator calculus Supercombinator System F System F-sub T Type inhabitation Typed lambda calculus Η Η-conversion