[1] : The Free On-line Dictionary of Computing (27 SEP 03)

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 vt, 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
     
     
see also:
algorithm currying bound variable monadic combinator 

Abstraction >> A Words
Abstraction, definition of term: Abstraction
abstraction_pag1.html

Bracket >> B Words
Bracket, definition of term: Bracket
bracket_pag1.html

Bracket Fungus >> B Words
Bracket Fungus, definition of term: Bracket Fungus
bracket+fungus_pag1.html

Tax Bracket >> T Words
Tax Bracket, definition of term: Tax Bracket
tax+bracket_pag1.html

Square Bracket >> S Words
Square Bracket, definition of term: Square Bracket
square+bracket_pag1.html

Curly Bracket >> C Words
Curly Bracket, definition of term: Curly Bracket
curly+bracket_pag1.html

Angle Bracket >> A Words
Angle Bracket, definition of term: Angle Bracket
angle+bracket_pag1.html