Abstract
We sketch a proof using a game-theoretic argument that the higher-order matching problem is decidable. © Springer-Verlag Berlin Heidelberg 2006.
Author supplied keywords
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for freeCite
CITATION STYLE
APA
Stirling, C. (2006). A game-theoretic approach to deciding higher-order matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4052 LNCS, pp. 348–359). Springer Verlag. https://doi.org/10.1007/11787006_30
Readers' Seniority
Readers' Discipline
