Decidability of higher-order matching

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

Bibliographic Details
Main Author:	Colin Stirling
Format:	Article
Language:	English
Published:	Logical Methods in Computer Science e.V. 2009-07-01
Series:	Logical Methods in Computer Science
Subjects:	computer science - logic in computer science computer science - computer science and game theory f.4.1
Online Access:	https://lmcs.episciences.org/757/pdf

Internet

https://lmcs.episciences.org/757/pdf