S. Abramsky, Domain theory in logical form*, Annals of Pure and Applied Logic, vol.51, issue.1-2, pp.1-77, 1991.
DOI : 10.1016/0168-0072(91)90065-T

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.

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

H. Barendregt, M. Coppo, and M. Dezani-ciancaglini, A filter lambda model and the completeness of type assignment, The Journal of Symbolic Logic, vol.37, issue.04, pp.931-940, 1983.
DOI : 10.1002/malq.19800261902

S. L. Bloom and Z. Esik, Iteration Theories: The Equational Logic of Iterative Processes, EATCS Monographs in Theoretical Computer Science, 1993.

L. Stephen and Z. Bloom, Fixed-point operations on CCC's. part I. Theoretical Computer Science, pp.1-38, 1996.

A. Blumensath, An algebraic proof of Rabin???s Tree Theorem, Theoretical Computer Science, vol.478, pp.1-21, 2013.
DOI : 10.1016/j.tcs.2013.01.026

C. Broadbent, A. Carayol, L. Ong, and O. 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. 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

C. H. Broadbent and N. Kobayashi, Saturation-based model checking of higherorder recursion schemes, CSL, pp.129-148, 2013.

W. Chen and M. Hofmann, Buchi abstraction, LICS, 2014.

R. Grabowski, M. Hofmann, and K. Li, Type-based enforcement of secure programming guidelines -code injection prevention at SAP. In Formal Aspects in Security and Trust, LNCS, vol.7140, pp.182-197, 2011.

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

M. Hague, A. S. Murawski, C. L. Ong, and O. Serre, Collapsible Pushdown Automata and Recursion Schemes, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, pp.452-461, 2008.
DOI : 10.1109/LICS.2008.34
URL : https://hal.archives-ouvertes.fr/hal-00345945

A. S. Jeffrey, LTL types FRP, Proceedings of the sixth workshop on Programming languages meets program verification, PLPV '12, 2012.
DOI : 10.1145/2103776.2103783

A. S. Jeffrey, Functional reactive types, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, 2014.
DOI : 10.1145/2603088.2603106

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

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

N. Kobayashi and L. 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

N. Kobayashi, N. Tabuchi, and H. Unno, Higher-order multi-parameter tree transducers and recursion schemes for program verification, POPL, pp.495-508, 2010.

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

F. Nielson and H. R. Nielson, Type and effect systems, Correct System Design: Recent Insight and Advances, pp.114-136, 1999.

C. 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

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

M. O. Rabin, Decidability of second-order theories and automata on infinite trees, Transactions of the AMS, vol.141, pp.1-23, 1969.

S. 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

S. Salvati and I. Walukiewicz, Krivine machines and higher-order schemes, ICALP, pp.162-173, 2011.
DOI : 10.1007/978-3-642-22012-8_12
URL : https://hal.archives-ouvertes.fr/hal-01121744

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

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

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

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

Y. Tobita, T. Tsukada, and N. Kobayashi, Exact Flow Analysis by Higher-Order Model Checking, FLOPS, pp.275-289, 2012.
DOI : 10.1007/978-3-642-29822-6_22

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