Journal of Symbolic Logic 65 (4):1850-1857 (2000)
A bracket abstraction algorithm is a means of translating λ-terms into combinators. Broda and Damas, in , introduce a new, rather natural set of combinators and a new form of bracket abstraction which introduces at most one combinator for each λ-abstraction. This leads to particularly compact combinatory terms. A disadvantage of their abstraction process is that it includes the whole Schonfinkel  algorithm plus two mappings which convert the Schonfinkel abstract into the new abstract. This paper shows how the new abstraction can be done more directly, in fact, using only 2n - 1 algorithm steps if there are n occurrences of the variable to be abstracted in the term. Some properties of the Broda-Damas combinators are also considered
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Extending the First-Order Theory of Combinators with Self-Referential Truth.Andrea Cantini - 1993 - Journal of Symbolic Logic 58 (2):477-513.
Abstraction in Fitch's Basic Logic.Eric Thomas Updike - 2012 - History and Philosophy of Logic 33 (3):215-243.
A General Theory of Abstraction Operators.Neil Tennant - 2004 - Philosophical Quarterly 54 (214):105-133.
Another Algorithm for Bracket Abstraction.D. A. Turner - 1979 - Journal of Symbolic Logic 44 (2):267-270.
Some Improvements to Turner's Algorithm for Bracket Abstraction.M. W. Bunder - 1990 - Journal of Symbolic Logic 55 (2):656-669.
Added to index2009-01-28
Total downloads111 ( #42,998 of 2,153,479 )
Recent downloads (6 months)1 ( #399,080 of 2,153,479 )
How can I increase my downloads?