A. Broadbent, L. Carayol, O. Ong, and . Serre, Recursion Schemes and Logical Reflection, 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp.120-129, 2010.
DOI : 10.1109/LICS.2010.40
URL : https://hal.archives-ouvertes.fr/hal-00479818

C. L. Broadbent and . Ong, On Global Model Checking Trees Generated by Higher-Order Recursion Schemes, FOSSACS, pp.107-121, 2009.
DOI : 10.1016/S0020-0190(02)00445-3

H. Broadbent, A. Carayol, M. Hague, and O. Serre, C-shore: a collapsible approach to higher-order verification, ICFP, pp.13-24, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00865155

W. Damm, The IO- and OI-hierarchies, Theoretical Computer Science, vol.20, issue.2, pp.95-207, 1982.
DOI : 10.1016/0304-3975(82)90009-3

A. Emerson and C. S. Jutla, Tree automata, mu-calculus and determinacy, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pp.368-377, 1991.
DOI : 10.1109/SFCS.1991.185392

E. M. Engelfriet, . Schmidt, and O. I. Io, IO and OI. I, Journal of Computer and System Sciences, vol.15, issue.3, pp.328-353, 1977.
DOI : 10.1016/S0022-0000(77)80034-2

E. M. Engelfriet, . Schnidt, O. Io, and . Ii, IO and OI. II, Journal of Computer and System Sciences, vol.16, issue.1, pp.67-99, 1978.
DOI : 10.1016/0022-0000(78)90051-X

T. Knapik, D. Niwinski, and P. Urzyczyn, Higher-Order Pushdown Trees Are Easy, FoSSaCS, pp.205-222, 2002.
DOI : 10.1007/3-540-45931-6_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.5773

. Kobayashi, Types and higher-order recursion schemes for verification of higher-order programs, POPL, pp.416-428, 2009.

. Kobayashi, Model Checking Higher-Order Programs, Journal of the ACM, vol.60, issue.3, pp.20-89, 2013.
DOI : 10.1145/2487241.2487246

L. Kobayashi and . Ong, A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes, 2009 24th Annual IEEE Symposium on Logic In Computer Science, pp.179-188, 2009.
DOI : 10.1109/LICS.2009.29

J. Naik and . Palsberg, A type system equivalent to a model checker, ACM Trans. Program. Lang. Syst, vol.30, issue.5, 2008.

-. L. Ong, On Model-Checking Trees Generated by Higher-Order Recursion Schemes, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pp.81-90, 2006.
DOI : 10.1109/LICS.2006.38

J. Ramsay, R. P. Neatherway, and C. L. Ong, A type-directed abstraction refinement approach to higher-order model checking, Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, pp.61-72, 2014.
DOI : 10.1145/2535838.2535873

I. Salvati and . Walukiewicz, Evaluation is MSOL-compatible, FSTTCS, pp.103-114, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00773126

I. Salvati and . Walukiewicz, Using models to model-check recursive schemes, TLCA, pp.189-204, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00741077

I. Salvati and . Walukiewicz, Typing Weak MSOL Properties, FoSSACS 2015
DOI : 10.1007/978-3-662-46678-0_22
URL : https://hal.archives-ouvertes.fr/hal-01394824

. Terui, Semantic evaluation, intersection types and complexity of simply typed lambda calculus, RTA, volume 15 of LIPIcs, pp.323-338, 2012.

C. L. Tsukada and . Ong, Compositional higher-order model checking via ?-regular games over Böhm trees, LICS-CSL, pp.1-7810, 2014.
DOI : 10.1145/2603088.2603133
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.649.4546

. Walukiewicz, Pushdown Processes: Games and Model Checking, BRICS Report Series, vol.3, issue.54, pp.234-263, 2001.
DOI : 10.7146/brics.v3i54.20057
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.4162