Higher-order matching and games

Authors:
Colin Stirling
Affiliations:
School of Informatics, University of Edinburgh
Venue:
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Year:
2005

Citing 7
Cited 3

Modal and temporal properties of processes

Modal and temporal properties of processes
Decidability of All Minimal Models

TYPES '95 Selected papers from the International Workshop on Types for Proofs and Programs
Linear Interpolation for the Higher-Order Matching Problem

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Higher-Order Matching and Tree Automata

CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Complexity of the higher order matching

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Higher-order unification and matching

Handbook of automated reasoning
Decidability of fourth-order matching

Mathematical Structures in Computer Science

Higher-order beta matching with solutions in long beta-eta normal form

Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Games, Automata and Matching

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Dependency Tree Automata

FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a game-theoretic characterisation of higher-order matching. The idea is suggested by model checking games. We then show that some known decidable instances of matching can be uniformly proved decidable via the game-theoretic characterisation.