Colin Stirling - Decidability of higher-order matching

lmcs:757 - Logical Methods in Computer Science, July 30, 2009, Volume 5, Issue 3 - https://doi.org/10.2168/LMCS-5(3:2)2009
Decidability of higher-order matchingArticle

Authors: Colin Stirling

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

Comment: appears in LMCS (Logical Methods in Computer Science)

https://doi.org/10.2168/LMCS-5(3:2)2009
Source: arXiv.org:0907.3804
Volume: Volume 5, Issue 3
Secondary volumes: Selected Papers of the 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006)
Published on: July 30, 2009
Imported on: September 20, 2006
Keywords: Computer Science - Logic in Computer Science, Computer Science - Computer Science and Game Theory, F.4.1
Licence: arXiv.org - Non-exclusive license to distribute

8 Documents citing this article

Share and export

Consultation statistics

This page has been seen 3274 times.
This article's PDF has been downloaded 868 times.