A game-theoretic approach to deciding higher-order matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4052 LNCS, Issue , 2006, Pages 348-359

  Stirling, Colin ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Games; Higher order matching; Typed lambda calculus

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; PATTERN MATCHING;

GAMES; HIGHER-ORDER MATCHING; TYPED LAMBDA CALCULUS;

GAME THEORY;

EID: 33746359692     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11787006_30     Document Type: Conference Paper

References (13)

1. Comon, H. and Jurski, Y. Higher-order matching and tree automata. Lecture Notes in Computer Science, 1414, 157-176, (1997).
2. Dougherty, D. and Wierzbicki, T. A decidable variant of higher order matching. Lecture Notes in Computer Science, 2378, 340-351, (2002).
3. Dowek, G. Third-order matching is decidable. Annals of Pure and Applied Logic, 69, 135-155, (1994).
4. Huet, G. Rèsolution d'èquations dans les langages d'ordre 1, 2,... ω. Thèse de doctorat d'ètat, Université Paris VII, (1976).
5. Loader, R. Higher-order β-matching is undecidable, Logic Journal of the IGPL, 11(1), 51-68, (2003).
6. Ong, C.-H. L. (2006) On model-checking trees generated by higher-order recursion schemes. Preprint.
7. Padovani, V. Decidability of all minimal models. Lecture Notes in Computer Science, 1158, 201-215, (1996).
8. Padovani, V. Decidability of fourth-order matching. Mathematical Structures in Computer Science, 10(3), 361-372, (2001).
9. Schubert, A. Linear interpolation for the higher-order matching problem. Lecture Notes in Computer Science, 1214, 441-452, (1997).
10. Schmidt-Schauß, M. Decidability of arity-bounded higher-order matching. Lecture Notes in Artificial Intelligence, 2741, 488-502, (2003).
11. Statman, R. The typed λ-calculus is not elementary recursive. Theoretical Computer Science, 9, 73-81, (1979).
12. Stirling, C. Modal and Temporal Properties of Processes, Texts in Computer Science, Springer, (2001).
13. Wierzbicki, T. Complexity of higher-order matching. Lecture Notes in Computer Science, 1632, 82-96, (1999).