Expedited Broda-Damas bracket abstraction
Journal of Symbolic Logic 65 (4):1850-1857 (2000)
| Abstract | A bracket abstraction algorithm is a means of translating λ-terms into combinators. Broda and Damas, in [1], 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 [4] 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 | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,679 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesAndrea Cantini (1993). Extending the First-Order Theory of Combinators with Self-Referential Truth. Journal of Symbolic Logic 58 (2):477-513.
Wayne Aitken & Jeffrey A. Barrett (2008). Abstraction in Algorithmic Logic. Journal of Philosophical Logic 37 (1).
Eric Thomas Updike (2012). Abstraction in Fitch's Basic Logic. History and Philosophy of Logic 33 (3):215-243.
Joongol Kim (2011). A Strengthening of the Caesar Problem. Erkenntnis 75 (1):123-136.
Neil Tennant (2004). A General Theory of Abstraction Operators. Philosophical Quarterly 54 (214):105-133.
Rafal Urbaniak (2010). Neologicist Nominalism. Studia Logica 96 (2):149-173.
D. A. Turner (1979). Another Algorithm for Bracket Abstraction. Journal of Symbolic Logic 44 (2):267-270.
M. W. Bunder (1990). Some Improvements to Turner's Algorithm for Bracket Abstraction. Journal of Symbolic Logic 55 (2):656-669.
Sabine Broda & Luís Damas (1997). Compact Bracket Abstraction in Combinatory Logic. Journal of Symbolic Logic 62 (3):729-740.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #274,830 of 549,087 )Recent downloads (6 months)1 ( #63,317 of 549,087 )How can I increase my downloads? |
My notes
Discussion
