Games, Automata and Matching

Authors:
Colin Stirling
Affiliations:
School of Informatics, University of Edinburgh,
Venue:
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Year:
2007

Citing 9
Cited 0

Modal and temporal properties of processes

Modal and temporal properties of processes
A New Characterization of Lambda Definability

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
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
Higher-order unification and matching

Handbook of automated reasoning
Decidability of fourth-order matching

Mathematical Structures in Computer Science
On Model-Checking Trees Generated by Higher-Order Recursion Schemes

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
A game-theoretic approach to deciding higher-order matching

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Higher-order matching and games

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

Higher-order matching is the problem given t= uwhere t, uare terms of simply typed 茂戮驴-calculus and uis closed, is there a substitution 茂戮驴such that t茂戮驴and uhave the same normal form with respect to β茂戮驴-equality: can tbe pattern matched to u? The problem was conjectured to be decidable by Huet [4]. Loader showed that it is undecidable when β-equality is the same normal form by encoding 茂戮驴-definability as matching [6].