Decidability of higher-order matching

Colin Stirling

Research output: Contribution to journalArticlepeer-review


We show that the higher-order matching problem is decidable using a game-theoretic argument.
Original languageEnglish
Article number2
Number of pages52
JournalLogical Methods in Computer Science
Issue number3
Publication statusPublished - Jul 2009

Fingerprint Dive into the research topics of 'Decidability of higher-order matching'. Together they form a unique fingerprint.

Cite this