Logical Methods in Computer Science (Jul 2009)

Decidability of higher-order matching

  • Colin Stirling

DOI
https://doi.org/10.2168/lmcs-5(3:2)2009
Journal volume & issue
Vol. Volume 5, Issue 3

Abstract

Read online

We show that the higher-order matching problem is decidable using a game-theoretic argument.

Keywords