One-combinator basis for lambda-terms
The Systematic Construction of a One-combinator Basis for Lambda-Terms.
Formal Aspects of Computing 4 (1992), pp. 776-780.
A single closed $\lambda$-expression that generates all
$\lambda$-expressions is constructed.
The derivation is carried out in a systematic way.
The resulting basis is simpler than bases
known in the literature.
Other relevant links