N. Kobayashi, Model checking higher-order programs, J. ACM, vol.60, issue.3, p.20, 2013.

T. Tsukada and N. Kobayashi, Untyped recursion schemes and infinite intersection types, FOSSACS'10, ser, vol.6014, pp.343-357, 2010.

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

Y. Nanjo, H. Unno, E. Koskinen, and T. Terauchi, A fixpoint logic and dependent effects for temporal property verification, LICS'18, pp.759-768, 2018.

H. Unno, Y. Satake, and T. Terauchi, Relatively complete refinement type system for verification of higher-order non-deterministic programs, PACMPL, vol.2, pp.1-12, 2018.

,

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

M. Hague, A. S. Murawski, C. L. Ong, and O. Serre, Collapsible pushdown automata and recursion schemes, ACM Trans. Comput. Log, vol.18, issue.3, 2017.
URL : https://hal.archives-ouvertes.fr/hal-00345945

N. Kobayashi and L. Ong, A type system equivalent to modal mucalculus model checking of recursion schemes, LICS, pp.179-188, 2009.

S. Salvati and I. Walukiewicz, Krivine machines and higher-order schemes, Inf. Comput, vol.239, pp.340-355, 2014.
URL : https://hal.archives-ouvertes.fr/inria-00589407

,

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

C. Grellois and P. Mellì, Finitary semantics of linear logic and higher-order model-checking, MFCS'15, ser, vol.9234, pp.256-268, 2015.

S. Salvati and I. Walukiewicz, A Model for Behavioural Properties of Higher-order Programs, CSL'15, ser. LIPIcs, vol.41, pp.229-243, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01145494

S. Salvati, Recognizability in the simply typed lambda-calculus, WoLLIC, ser. LNCS, vol.5514, pp.48-60, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00412654

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

,

, Using models to model-check recursive schemes, Logical Methods in Computer Science, vol.11, issue.2, 2015.

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

P. Mellì, Higher-order verification, workshop on Abstraction and Verification in Semantics. A part of IHP semester on Semantics of proofs and certified mathematics, 2014.

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, ´. E. Lozes, and F. Bruse, On the relationship between higher-order recursion schemes and higher-order fixpoint logic, POPL'17, pp.246-259, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01920615

C. Grellois, Semantics of linear logic and higher-order model-checking. (sémantique de la logique linéaire et "model-checking" d'ordre supérieur), 2016.
URL : https://hal.archives-ouvertes.fr/tel-01311150

F. Bruse, Alternating parity krivine automata, MFCS, ser. LNCS, vol.8634, pp.111-122, 2014.

P. Mellì, Higher-order parity automata, LICS, pp.1-12, 2017.

R. Suzuki, K. Fujima, N. Kobayashi, and T. Tsukada, Streett automata model checking of higher-order recursion schemes, FSCD' 2017, ser. LIPIcs, vol.84, pp.1-32, 2017.

,

M. Hague, R. Meyer, and S. Muskalla, Domains for higher-order games, MFCS'17, ser. LIPIcs, vol.83, 2017.

M. Hague, R. Meyer, S. Muskalla, and M. Zimmermann, Parity to safety in polynomial time for pushdown and collapsible pushdown systems, MFCS'18, ser. LIPIcs, vol.117, 2018.

R. M. Amadio and P. Curien, Domains and Lambda-Calculi, ser. Cambridge Tracts in Theoretical Computer Science, 1998.

N. Kobayashi, K. Matsuda, and A. Shinohara, Functional programs as compressed data, Workshop on Partial Evaluation and Program Manipulation, PEPM 2012, pp.121-130, 2012.

A. Haddad, Model checking and functional program transformations, FSTTCS, ser. LIPIcs, vol.24, pp.115-126, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00865682

S. Van-bakel, The heart of intersection type assignment: Normalisation proofs revisited, Theor. Comput. Sci, vol.398, issue.1-3, pp.82-94, 2008.

S. Salvati and I. Walukiewicz, Simply typed fixpoint calculus and collapsible pushdown automata, Mathematical Structures in Computer Science, vol.26, issue.7, pp.1304-1350, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01394828

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.

A. Haddad, IO vs OI in higher-order recursion schemes, FICS, ser. EPTCS, vol.77, pp.23-30, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00865681

F. Bruse, O. Friedmann, and M. Lange, On guarded transformation in the modal µ-calculus, Logic Journal of the IGPL, vol.23, issue.2, pp.194-216, 2015.

R. Sato and N. Kobayashi, Modular verification of higherorder functional programs, ESOP'17, ser, vol.10201, pp.831-854, 2017.

P. Clairambault, C. Grellois, and A. S. Murawski, Linearity in higher-order recursion schemes, PACMPL, vol.2, pp.1-39, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01886931

N. Kobayashi, T. Tsukada, and K. Watanabe, Higher-order program verification via HFL model checking, ESOP'18, ser, vol.10801, pp.711-738, 2018.