Dependency tree automata

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

Volumn 5504 LNCS, Issue , 2009, Pages 92-106

  Stirling, Colin ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Binding terms; Tree automata; Typed lambda calculus

Indexed keywords

BINDING TERMS; CHARACTERISATION; DECIDING PROPERTIES; HIGHER-ORDER MATCHING; NONDETERMINISTIC AUTOMATA; TREE AUTOMATA; TYPED LAMBDA CALCULUS;

CALCULATIONS; COMPUTATIONAL MECHANICS; COMPUTER SOFTWARE; DIFFERENTIATION (CALCULUS); ROBOTS; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 70350677118     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00596-1_8     Document Type: Conference Paper

References (15)

1. Alur, R., Madhusudan, P.: Adding nested structure to words. In: H. Ibarra, O., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 1-13. Springer, Heidelberg (2006)
2. Alur, R., Chaudhuri, S., Madhusudan, P.: Languages of nested trees. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 329-342. Springer, Heidelberg (2006)
3. Barendregt, H.: Lambda calculi with types. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, vol. 2, pp. 118-309. Oxford University Press, Oxford (1992)
4. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. Draft Book (2002), http://l3ux02.univ-lille3.fr/tata/
5. Comon, H., Jurski, Y.: Higher-order matching and tree automata. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol. 1414, pp. 157-176. Springer, Heidelberg (1998)
6. Joly, T.: The finitely generated types of the lambda calculus. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, pp. 240-252. Springer, Heidelberg (2001)
7. Ong, C.-H.L.: On model-checking trees generated by higher-order recursion schemes. In: Procs. LICS 2006, pp. 81-90 (2006); (Longer version available from Ong's web page, 55 pages (preprint, 2006)
8. Padovani, V.: Decidability of fourth-order matching. Mathematical Structures in Computer Science, vol. 10(3), pp. 361-372 (2001)
9. Segoufin, L.: Automata and logics for words and trees over an infinite alphabet. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 41-57. Springer, Heidelberg (2006)
10. Schubert, A.: Linear interpolation for the higher-order matching problem. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol. 1214, pp. 441-452. Springer, Heidelberg (1997)
11. Statman, R.: Completeness, invariance and λ-definability. The Journal of Symbolic Logic 47, 17-26 (1982)
12. Stirling, C.: Higher-order matching and games. In: Ong, L. (ed.) CSL 2005. LNCS, vol. 3634, pp. 119-134. Springer, Heidelberg (2005)
13. Stirling, C.: A game-theoretic approach to deciding higher-order matching. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 348-359. Springer, Heidelberg (2006)
14. Stirling, C.: Higher-order matching, games and automata. In: Procs. LICS 2007, pp. 326-335 (2007)
15. Støvring, K.: Higher-order beta matching with solutions in long beta-eta normal form. Nordic Journal of Computing 13, 117-126 (2006)