The combinatory completeness of the typed theory of combinators and the equality in expressive power of the typed theory of combinators and typed $\lambda$-calculus are proved.