Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Lecture Notes in Computer Science;H. Comon,1998
2. Huet, G.: Rèsolution d’èquations dans les langages d’ordre 1, 2, ... ω. Thèse de doctorat d’ètat, Universitè Paris VII (1976)
3. Ong, C.-H.L.: On model-checking trees generated by higher-order recursion schemes. In: Procs. LICS 2006, pp. 81–90 (2006)
4. Ong, C.-H.L., Tzevelekos: Functional reachability. In: Procs. LICS 2009, pp. 286–295 (2009)
5. Stirling, C.: Higher-order matching, games and automata. In: Procs. LICS 2007, pp. 326–335 (2007)