Another algorithm for bracket abstraction
David A. Turner · Journal of Symbolic Logic · 1979
This short article presents an algorithm for bracket abstraction [1] which avoids a combinatorial explosion in the size of the resulting expression when applied repeatedly for abstraction in a series of variables. It differs from a previous solution [2] in introducing only a finite number of additional combinators and in not requiring that all the variables to be abstracted be treated together in a single operation.
Cited by 116 works. doi:10.2307/2273733