Stirling, Colin - Decidability of higher-order matching

lmcs:757 - Logical Methods in Computer Science, July 30, 2009, Volume 5, Issue 3
Decidability of higher-order matching

Authors: Stirling, Colin

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


Source : oai:arXiv.org:0907.3804
DOI : 10.2168/LMCS-5(3:2)2009
Volume: Volume 5, Issue 3
Published on: July 30, 2009
Submitted on: September 20, 2006
Keywords: Computer Science - Logic in Computer Science,Computer Science - Computer Science and Game Theory,F.4.1


Share

Consultation statistics

This page has been seen 86 times.
This article's PDF has been downloaded 55 times.