BRACKET ABSTRACTION

Domain	Definition
Computing	Bracket abstraction 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). Source: The Free On-line Dictionary of Computing.
Source: compiled by the editor from various references; see credits.

Anagrams: BRACKET ABSTRACTION

Scrabble® Enable2K-Verified Anagrams
	Words within the letters "a-a-a-b-b-c-c-e-i-k-n-o-r-r-s-t-t-t"
	-5 letters: attractancies.
Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro.

Alternative Orthography: BRACKET ABSTRACTION

Hexadecimal (or equivalents, 770AD-1900s) (references)

Leonardo da Vinci (1452-1519; backwards) (references)

Binary Code (1918-1938, probably earlier) (references)

HTML Code (1990) (references)

ISO 10646 (1991-1993) (references)

Encryption (beginner's substitution cypher): (references)

Specialty Definition: BRACKET ABSTRACTION