Expedited Broda-Damas bracket abstraction (Q2710613)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Expedited Broda-Damas bracket abstraction |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Expedited Broda-Damas bracket abstraction |
scientific article |
Statements
Expedited Broda-Damas bracket abstraction (English)
0 references
21 January 2002
0 references
lambda-calculus
0 references
combinators
0 references
bracket abstraction
0 references
0.8423498
0 references
0 references
0.82190585
0 references
0.8065819
0 references
0.79464024
0 references
0.7944013
0 references
The Broda-Damas bracket algorithm translates lambda-terms into combinators using Schönfinkel's bracket abstraction and two mappings. Two expedited Broda-Damas algorithms (EBDA1, EBDA2), are defined, both connected with some advantageous features, in particular, EBDA2 requires fewer algorithm steps for evaluations of abstractions than EBDA1 (useful if ``the speed of abstraction rather than the simplicity of the abstract is important'').NEWLINENEWLINENEWLINEAll the lambda-terms definable in terms of EBDA1/EBDA2 can be abstracted without the use of (the combinator) K.
0 references
