Dictionary.net

An algorithm which turns a term into a functionof some variable. The result of using bracket abstraction onT with respect to variable v, written as [v]T, is a termcontaining no occurrences of v and denoting a function f suchthat f v = T. This defines the function f = (\ v . T). Usingbracket abstraction and currying we can define a languagewithout bound variables in which the only operation ismonadic function application.See combinator.