K. Aehlig, A finite semantics of simply-typed lambda terms for infinite runs of automata, Logical Methods in Computer Science, vol.3, issue.3, 2007.

R. Axelsson, M. Lange, and R. Somla, The complexity of model checking higher-order fixpoint logic, Logical Methods in Computer Science, vol.3, issue.2, 2007.

C. H. Broadbent and N. Kobayashi, Saturation-based model checking of higher-order recursion schemes, Schloss Dagstuhl-LeibnizZentrum fuer Informatik, vol.23, pp.129-148, 2013.

E. M. Clarke, O. Grumberg, and D. A. Peled, , 1999.

E. Grädel, W. Thomas, and T. Wilke, Automata, Logics, and Infinite Games: A Guide to Current Research, vol.2500, 2002.

M. Hague, A. Murawski, C. L. Ong, and O. Serre, Collapsible pushdown automata and recursion schemes, Proceedings of LICS 2008, pp.452-461, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00345945

N. D. Jones, The expressive power of higher-order types or, life without CONS, Journal of Functional Programming, vol.11, issue.1, pp.5-94, 2001.

T. Knapik, D. Niwinski, and P. Urzyczyn, Higher-order pushdown trees are easy, FoSSaCS, vol.2303, pp.205-222, 2002.

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

N. Kobayashi, Model-checking higher-order functions, Proceedings of PPDP 2009, pp.25-36, 2009.

N. Kobayashi, A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes, Proceedings of FoSSaCS, vol.6604, pp.260-274, 2011.

N. Kobayashi, Model checking higher-order programs, Journal of the ACM, vol.60, issue.3, 2013.

N. Kobayashi and C. L. Ong, A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes, Proceedings of LICS 2009, pp.179-188, 2009.

N. Kobayashi and C. L. Ong, Complexity of model checking recursion schemes for fragments of the modal mu-calculus, Logical Methods in Computer Science, vol.7, issue.4, 2011.

N. Kobayashi and C. L. Ong, A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. A revised and extended version of, vol.13

N. Kobayashi, R. Sato, and H. Unno, Predicate abstraction and CEGAR for higher-order model checking, Proceedings of PLDI 2011, pp.222-233, 2011.

N. Kobayashi, É. Lozes, and F. Bruse, On the relationship between higher-order recursion schemes and higher-order fixpoint logic, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01920615

T. Kuwahara, T. Terauchi, H. Unno, and N. Kobayashi, Automatic termination verification for higher-order functional programs, Proceedings of ESOP 2014, vol.8410, pp.392-411, 2014.

T. Kuwahara, R. Sato, H. Unno, and N. Kobayashi, Predicate abstraction and CEGAR for disproving termination of higher-order functional programs, Proceedings of CAV 2015, vol.9207, pp.287-303, 2015.

M. Lange, É. Lozes, and M. V. Guzmán, Model-checking process equivalences, Theor. Comput. Sci, vol.560, pp.326-347, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01905142

É. Lozes, A type-directed negation elimination, Proceedings of Tenth International Workshop on Fixed Points in Computer Science (FICS 2015), vol.191, pp.132-142, 2015.

M. Müller-olm, A modal fixpoint logic with chop, Proceedings of STACS 99, vol.1563, pp.510-520, 1999.

A. Murase, T. Terauchi, N. Kobayashi, R. Sato, and H. Unno, Temporal verification of higher-order functional programs, Proceedings of POPL 2016, pp.57-68, 2016.

R. P. Neatherway, S. J. Ramsay, and C. L. Ong, A traversal-based algorithm for higher-order model checking, Proceedings of ICFP '12, pp.353-364, 2012.

C. L. Ong, On model-checking trees generated by higher-order recursion schemes, Proceedings of LICS 2006, pp.81-90, 2006.

C. L. Ong and S. Ramsay, Verifying higher-order programs with pattern-matching algebraic data types, Proceedings of POPL 2011, pp.587-598, 2011.

S. Ramsay, R. Neatherway, and C. L. Ong, An abstraction refinement approach to higher-order model checking, Proceedings of POPL 2014, pp.61-72, 2014.

S. Salvati and I. Walukiewicz, Krivine machines and higher-order schemes, Proceedings of ICALP 2011, vol.6756, pp.162-173, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00589407

S. Salvati and I. Walukiewicz, Typing weak MSOL properties, Proceedings of FoSSaCS, vol.9034, pp.343-357, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01394824

S. Salvati and I. Walukiewicz, A model for behavioural properties of higher-order programs, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, pp.229-243, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01145494

C. Stirling and D. Walker, Local model checking in the modal mucalculus, Theoretical Computer Science, vol.89, issue.1, pp.161-177, 1991.

T. Tsukada and C. L. Ong, Compositional higher-order model checking via ?-regular games over böhm trees, Proceedings of CSL-LICS '14, vol.78, pp.1-78, 2014.

H. Unno, T. Terauchi, and N. Kobayashi, Automating relatively complete verification of higher-order functional programs, Proceedings of POPL 2013, pp.75-86, 2013.

M. Viswanathan and R. Viswanathan, A higher order modal fixed point logic, Proceedings of CONCUR 2004, vol.3170, pp.512-528, 2004.

K. Yasukata, N. Kobayashi, and K. Matsuda, Pairwise reachability analysis for higher order concurrent programs by higher-order model checking, Proceedings of CONCUR 2014, vol.8704, pp.312-326, 2014.