Stirling, Colin A game-theoretic approach to deciding higher-order matching. (English) Zbl 1133.03315 Bugliesi, Michele (ed.) et al., Automata, languages and programming. 33rd international colloquium, ICALP 2006, Venice, Italy, July 10–14, 2006. Proceedings, Part II. Berlin: Springer (ISBN 978-3-540-35907-4/pbk). Lecture Notes in Computer Science 4052, 348-359 (2006). Summary: We sketch a proof using a game-theoretic argument that the higher-order matching problem is decidable.For the entire collection see [Zbl 1113.68003]. Cited in 4 Documents MSC: 03B25 Decidability of theories and sets of sentences 03B40 Combinatory logic and lambda calculus 91A80 Applications of game theory Keywords:Games; higher-order matching; typed lambda calculus PDFBibTeX XMLCite \textit{C. Stirling}, Lect. Notes Comput. Sci. 4052, 348--359 (2006; Zbl 1133.03315) Full Text: DOI Link