Journal ArticleOPEN ACCESS

Decidability of higher-order matching

  • Stirling C
Logical Methods in Computer Science (2009) Volume 5, Issue 3
DOI: 10.2168/lmcs-5(3:2)2009
N/ACitations
Citations of this article
21Readers
Mendeley users who have this article in their library.

Abstract

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

Cite

CITATION STYLE

APA

Stirling, C. (2009). Decidability of higher-order matching. Logical Methods in Computer Science, Volume 5, Issue 3. https://doi.org/10.2168/lmcs-5(3:2)2009

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free