An algorithm which turns a term into a funCTIon of some variable. The result of using bracket abstraCTIon on T with respect to variable v, written as [v]T, is a term containing no occurrences of v and denoting a funCTIon f such that f v = T. This defines the funCTIon f = ( v . T). Using bracket abstraCTIon and currying we can define a language without bound variables in which the only operation is monadic funCTIon application. See combinator. (1995-03-07)