On Statman's Finite Completeness Theorem
Abstract
We give a complete self-contained proof of Statman's finite completeness theorem and of a corollary of this theorem stating that the λ-definability conjecture implies the higher-order matching conjecture.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.