ANalgorithm 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)
