Decidability of higher-order matching
Abstract
We show that the higher-order matching problem is decidable using a game-theoretic argument.
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.