bracket abstraction

Computing Dictionary

bracket abstraction definition

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

The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source
Explore Dictionary.com
Previous Definition: bracket
Next Definition: bracket clock
More from Thesaurus.com
Synonyms and Antonyms for bracket abstraction
More from Reference.com
Search for articles containing bracket abstraction
Dictionary.com Word FAQs

Dictionary.com presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014 Dictionary.com, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature