Decidability of higher-order matching
Logic in Computer Science
2015-07-01 v3 Computer Science and Game Theory
Abstract
We show that the higher-order matching problem is decidable using a game-theoretic argument.
Keywords
Cite
@article{arxiv.0907.3804,
title = {Decidability of higher-order matching},
author = {Colin Stirling},
journal= {arXiv preprint arXiv:0907.3804},
year = {2015}
}
Comments
appears in LMCS (Logical Methods in Computer Science)