Decidability of higher-order matching
We show that the higher-order matching problem is decidable using a game-theoretic argument.
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2009-07-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/757/pdf |
Summary: | We show that the higher-order matching problem is decidable using a
game-theoretic argument. |
---|---|
ISSN: | 1860-5974 |