A Compositive Abstraction Algorithm for Combinatory Logic

The problem of the translation of λ-terms into combinators (bracket abstraction) is of great importance for the implementation of functional languages. In the literature there exist a lot of algorithms concerning this topic, each of which is based on a particular choice of a combinatory basis, of its cardinality, of an abstraction technique.