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 iSmonadic function application. See combinator. (1995-03-07)
