On Statman's Finite Completeness Theorem

We give a complete self-contained proof of Statman’s finite completeness theorem and of a corollary of this theorem stating that the $\lambda$-definability conjecture implies the higher-order matching conjecture.