P. Aczel, Non-well-founded Sets. Number 14 in Lecture Notes. Center for the Study of Language and Information, 1988.

K. Aehlig, J. G. De-miranda, and C. Ong, The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable, TLCA '05, pp.39-54, 2005.
DOI : 10.1007/11417170_5

K. Aehlig, A finite semantics of simply-typed lambda terms for infinite runs of automata, Ésik [Ési06], pp.104-118

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

D. [. Arnold and . Niwinski, Rudiments of &mgr;-calculus

D. Baelde, Least and greatest fixed points in linear logic, ACM Trans. Comput. Log, vol.13, issue.276, p.30, 2012.

P. Baillot, Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy, LNCS, vol.3, issue.1-2, pp.337-352, 2011.
DOI : 10.1016/S1571-0661(05)80409-8

URL : https://hal.archives-ouvertes.fr/hal-00624742

]. H. Bar84 and . Barendregt, The lambda calculus: its syntax and semantics . Studies in logic and the foundations of mathematics, p.56, 1984.

M. Barr, Terminal coalgebras in well-founded set theory, Theoretical Computer Science, vol.114, issue.2, pp.299-315, 1993.
DOI : 10.1016/0304-3975(93)90076-6

H. Christopher, A. Broadbent, M. Carayol, O. Hague, and . Serre, C-shore: a collapsible approach to higher-order verification, ICFP '13, pp.13-24, 2013.

C. H. Broadbent, A. Carayol, C. 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

Z. [. Bloom and . Ésik, Iteration theories: the equational logic of iterative processes. EATCS monographs on theoretical computer science, 1993.

L. Stephen, Z. Bloom, and . Ésik, Fixed-point operations on CCC's. Part I, TCS, vol.155, issue.255, p.275, 1996.

A. Bucciarelli and T. Ehrhard, On phase semantics and denotational semantics in multiplicative???additive linear logic, Annals of Pure and Applied Logic, vol.102, issue.3, pp.247-282, 2000.
DOI : 10.1016/S0168-0072(99)00040-8

URL : https://hal.archives-ouvertes.fr/hal-00527039

A. Bucciarelli and T. Ehrhard, On phase semantics and denotational semantics: the exponentials, Annals of Pure and Applied Logic, vol.109, issue.3, pp.205-241, 2001.
DOI : 10.1016/S0168-0072(00)00056-7

URL : https://hal.archives-ouvertes.fr/hal-00527042

J. Beck, Seminar on Triples and Categorical Homology Theory: ETH 1966/67, chapter Distributive laws, pp.119-140, 1969.

A. Bouajjani, J. Esparza, and O. Maler, Reachability analysis of pushdown automata: Application to model-checking
DOI : 10.1007/3-540-63141-0_10

[. Basold and H. Hansen, Well-definedness and observational equivalence for inductive???coinductive programs, Journal of Logic and Computation
DOI : 10.1093/logcom/exv091

M. Gavin and . Bierman, What is a categorical model of intuitionistic linear logic?, TLCA '95, pp.78-93

[. Blum and C. Ong, The safe lambda calculus, Logical Methods in Computer Science, vol.5, issue.1, 2009.

[. Böhm, Alcune proprietà delle forme ?-?-normali nel ??K calcolo, 1968.

A. Bucciarelli, Logical relations and lambda -theories Advances in Theory and Formal Methods of Computing, proceedings of the 3rd Imperial College Workshop, pp.47-48, 1997.

J. Bradfield and I. Walukiewicz, The mu-calculus and model-checking Handbook of Model Checking, p.35, 2015.

D. Caucal, On Infinite Terms Having a Decidable Monadic Theory, MFCS '02, pp.165-176, 2002.
DOI : 10.1007/3-540-45687-2_13

M. Coppo, M. Dezani-ciancaglini, F. Honsell, and G. Longo, Extended Type Structures and Filter Lambda Models, Logic Colloquium 82, 1984.
DOI : 10.1016/S0049-237X(08)71819-6

E. M. Clarke and E. Emerson, Design and synthesis of synchronization skeletons using branching-time temporal logic, Logics of Programs, pp.52-71, 1981.

[. Carraro, T. Ehrhard, and A. Salibra, Exponentials with Infinite Multiplicities, Anuj Dawar and Helmut Veith, pp.170-184, 2010.
DOI : 10.1007/978-3-642-15205-4_16

URL : https://hal.archives-ouvertes.fr/hal-00527050

P. Clairambault, Least and Greatest Fixpoints in Game Semantics, FOSSACS '09, pp.16-31978, 2009.
DOI : 10.2140/pjm.1955.5.285

URL : https://hal.archives-ouvertes.fr/hal-00443537

P. Clairambault, Strong functors and interleaving fixpoints in game semantics RAIRO -Theor, Inf. and Applic, vol.47, issue.1, pp.25-68, 2013.

B. Courcelle, Recursive Applicative Program Schemes, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pp.459-492, 1990.
DOI : 10.1016/B978-0-444-88074-1.50014-7

]. B. Cou97 and . Courcelle, Handbook of graph grammars and computing by graph transformation. chapter The Expression of Graph Properties and Graph Transformations in Monadic Second-order Logic, pp.313-400, 1997.

A. Carayol and O. Serre, Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.165-174
DOI : 10.1109/LICS.2012.73

URL : https://hal.archives-ouvertes.fr/hal-00733467

P. Curien, Introduction to linear logic and ludics, part i, p.65, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00003920

A. Carayol and S. Wöhrle, The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata, FSTTCS '03, pp.112-123, 2003.
DOI : 10.1007/978-3-540-24597-1_10

[. Czajka, Coinductive techniques in infinitary lambdacalculus . CoRR, abs/1501.04354, pp.90-93, 2015.

[. Damm, Higher type program schemes and their tree languages
DOI : 10.1007/3-540-08138-0_5

. Walter, URL: http: //dx.doi.org/10, Theoretical Computer Science, 3rd GI-Conference, pp.51-72, 1977.

[. Damm, Languages defined by higher type program schemes, LNCS, vol.52, issue.68, pp.164-179, 1977.
DOI : 10.1007/3-540-08342-1_13

W. Damm, The IO- and OI-hierarchies, 76.) [DBL05] LICS '05, pp.95-207, 1982.
DOI : 10.1016/0304-3975(82)90009-3

C. Daniel-de, Execution time of lambda-terms via denotational semantics and intersection types. CoRR, abs/0905, pp.20-115, 2009.

W. Damm and E. Fehr, A schematalogical approach to the analysis of the procedure concept in algol-languages, Proc. 5ème Colloque sur les Arbres en Algèbre et en Programmation, pp.130-134, 1980.

A. Brian, H. A. Davey, and . Priestley, Introduction to lattices and order, 1990.

[. Ehrhard, Collapsing non-idempotent intersection types Schloss Dagstuhl -Leibniz- Zentrum fuer Informatik, CSL '12, pp.259-273, 2012.

T. Ehrhard, The Scott model of linear logic is the extensional collapse of its relational model, Theoretical Computer Science, vol.424, issue.277, pp.20-45, 2012.
DOI : 10.1016/j.tcs.2011.11.027

URL : https://hal.archives-ouvertes.fr/hal-00369831

[. Ehrhard, Lambda-calcul : syntaxe et sémantique, Cours au MPRI, 2014.

T. Ehrhard, A semantical introduction to differential linear logic, 2016.

J. Endrullis and A. Polonsky, Infinitary rewriting coinductively Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik URL: http://dx.doi. org/10.4230/LIPIcs Differential interaction nets, TYPES.2011.16. (Cited on pages 87, 94, and 274.) BIBLIOGRAPHY [ER05] Thomas Ehrhard and Laurent Regnier, pp.16-2735, 2005.

K. Fujima, S. Ito, and N. Kobayashi, Practical Alternating Parity Tree Automata Model Checking of Higher-Order Recursion Schemes, LNCS, vol.8301, issue.13, pp.17-32978, 2013.
DOI : 10.1007/978-3-319-03542-0_2

J. Fortier and L. Santocanale, Cuts for circular proofs: semantics and cut-elimination, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.248-262, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01260986

J. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-1020304, 1987.
DOI : 10.1016/0304-3975(87)90045-4

URL : https://hal.archives-ouvertes.fr/inria-00075966

J. Goubault-larrecq, Logique et informatique II: Aspects logiques. Cours aux ENS d'Ulm et de Cachan, 2015.

P. Melliès, Finitary semantics of linear logic and higher-order model-checking, MFCS '15, pp.256-268978, 2015.

C. Grellois and P. Melliès, Indexed linear logic and higher-order model checking, Electronic Proceedings in Theoretical Computer Science, vol.177, issue.273, pp.43-52, 2015.
DOI : 10.4204/EPTCS.177.4

C. Grellois and P. Melliès, An infinitary model of linear logic URL: http://dx.doi, Pitts [Pit15], pp.41-55

C. Grellois and P. Melliès, Relational semantics of linear logic and higher-order model checking, Kreutzer [Kre15], pp.260-276

[. Goldberg, On the recursive enumerability of fixedpoint combinators URL: http://www.brics.dk, 2005.

[. Grellois, Game semantics of higher-order recursion schemes establishes the decidability of mso model-checking. Master thesis, available on: http://research.grellois.fr/ doc/grellois-game-semantics-and-ho-model-checking.pdf, p.26, 2010.

J. Girard, P. Taylor, and Y. Lafont, Proofs and Types, C.U.P, 1989.

E. Grädel, W. Thomas, and T. Wilke, Automata, Logics, and Infinite Games: A Guide to Current Research URL: https://books.google.fr/books?id= 2-Vl9Za93xIC, LNCS, vol.2500, 2002.
DOI : 10.1007/3-540-36387-4

A. Haddad, IO vs OI in Higher-Order Recursion Schemes, Electronic Proceedings in Theoretical Computer Science, vol.77, issue.12, pp.23-30, 2012.
DOI : 10.4204/EPTCS.77.4

URL : https://hal.archives-ouvertes.fr/hal-00865681

A. Had13a and . Haddad, Model checking and functional program transformations, Seth and Vishnoi [SV13], pp.115-126

. Haddad, Shape-Preserving Transformations of Higher-Order Recursion Schemes Thèse de doctorat URL: http://www.liafa.univ-paris-diderot.fr/~haddad/ Shape-PreservingTransformationsofHigher-OrderRecursionSchemes. pdf, 271.) [Has99] Masahito Hasegawa. Models of Sharing Graphs: A Categorical Semantics of Let and Letrec. Number 1192 in Distinguished dissertations series, 1999.

[. Hague, A. S. Murawski, C. 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

G. Huet and B. C. Pierce, URL: http://yquem.inria.fr/~huet/PUBLIC/Huet1976.pdf. (Cited on page 250 Regular expression types for XML, Thèse de doctorat BIBLIOGRAPHY [HVP05] Haruo Hosoya, Jerome Vouillon, pp.46-90, 1976.

[. Indermark, Schemes with recursion on higher types, MFCS '76, pp.352-358, 1976.
DOI : 10.1007/3-540-07854-1_198

[. Joyal, R. Street, and D. Verity, Traced monoidal categories, Mathematical Proceedings of the Cambridge Philosophical Society, vol.1488, issue.03, pp.447-468, 1996.
DOI : 10.1007/BF02096491

D. Janin and I. Walukiewicz, Automata for the modal mucalculus and related results, MFCS '95, pp.552-562, 1995.

D. Janin and I. Walukiewicz, On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic, LNCS, vol.1119, issue.96, pp.263-277, 1996.
DOI : 10.1007/3-540-61604-7_60

[. Knapik, D. Niwinski, and P. Urzyczyn, Deciding Monadic Theories of Hyperalgebraic Trees, TLCA '01, pp.253-267, 2001.
DOI : 10.1007/3-540-45413-6_21

[. Knapik, D. Niwinski, and P. Urzyczyn, Higherorder pushdown trees are easy URL: http://dx.doi.org/10, pp.205-222

[. Knapik, D. Niwinski, P. Urzyczyn, I. W. , G. F. Italiano et al., Unsafe Grammars and Panic Automata, Luís Caires, ICALP '05, pp.1450-1461, 2005.
DOI : 10.1007/11523468_117

URL : https://hal.archives-ouvertes.fr/hal-00335729

. Ko-]-naoki, C. Kobayashi, and . Ong, A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes (journal version, in preparation), pp.31-147

[. Kobayashi and C. 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.22-29, 2009.
DOI : 10.1109/LICS.2009.29

[. Kobayashi, Model-checking higher-order functions, Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming, PPDP '09, pp.25-36, 2009.
DOI : 10.1145/1599410.1599415

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

N. Kobayashi, A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes, LNCS, vol.6604, issue.11, pp.260-274978, 2011.
DOI : 10.1007/978-3-642-19805-2_18

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

S. Dagstuhl-leibniz-zentrum-fuer-informatik, URL: http://www.dagstuhl.de/dagpub/978-3-939897-90-3, p.285, 2015.

J. Krivine, A call-by-name lambda-calculus machine. Higher-Order and Symbolic Computation, pp.199-207, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00154508

A. Dexter-kozen and . Silva, Practical coinduction, Computing and Information Science, 2012.

[. Levy, Call-by-push-value: Decomposing call-byvalue and call-by-name. Higher-Order and Symbolic Computation, pp.377-414, 2006.
DOI : 10.1007/978-94-007-0954-6

P. Melliès, Asynchronous games 4: A fully complete model of propositional linear logic URL: http://dx.doi.org/10 Asynchronous games 2: The true concurrency of innocence, LICS '05 [DBL05]LICS.2005. 6. (Cited on page 236.) BIBLIOGRAPHY [Mel06a] Paul-André Melliès, pp.386-395200, 1109.

[. Melliès, Functorial Boxes in String Diagrams, Ésik [Ési06], pp.1-30
DOI : 10.1007/11874683_1

P. Melliès, Categorical semantics of linear logic In Interactive models of computation and program behaviour, pp.1-196, 2009.

P. Melliès, Game Semantics in String Diagrams, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.481-490, 2012.
DOI : 10.1109/LICS.2012.58

[. Melliès, Linear logic and higher-order model-checking. Talk at Institut Henri Poincaré

[. Melliès, The parametric continuation monad, Mathematical Structures in Computer Science, vol.420, issue.237, p.151, 2014.
DOI : 10.1016/0890-5401(91)90052-4

P. Melliès, Dialogue Categories and Chiralities, Publications of the Research Institute for Mathematical Sciences, vol.52, issue.4, p.141, 2016.
DOI : 10.4171/PRIMS/185

[. Melliès, Une étude micrologique de la négation. Habilitation à diriger des recherches, p.15

[. Milner, A theory of type polymorphism in programming, Journal of Computer and System Sciences, vol.17, issue.3, pp.348-375, 1978.
DOI : 10.1016/0022-0000(78)90014-4

A. Miquel, Le calcul des constructions implicites : syntaxe et sémantique, 2001.

R. Montelatici, Polarized Proof Nets with Cycles and Fixpoints Semantics, TLCA '03, pp.256-270, 2003.
DOI : 10.1007/3-540-44904-3_18

E. David, P. E. Muller, and . Schupp, The theory of ends, pushdown automata, and second-order logic, Theor. Comput . Sci, vol.3785, pp.51-75, 1985.

E. David, P. E. Muller, and . Schupp, Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of rabin, mcnaughton and safra, Theor. Comput. Sci, vol.141, issue.1&294, pp.69-1070304, 1995.

P. Melliès and N. Tabareau, Resource modalities in tensor logic, Annals of Pure and Applied Logic, vol.161, issue.5, pp.632-653, 2010.
DOI : 10.1016/j.apal.2009.07.018

[. Melliès and J. Vouillon, Recursive Polymorphic Types and Parametricity in an Operational Framework, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.82-91
DOI : 10.1109/LICS.2005.42

M. Nivat, On the interpretation of recursive program schemes, Symposia Matematica, p.14, 1972.

D. Niwinski, Fixed points vs. infinite generation, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science, pp.402-409, 1988.
DOI : 10.1109/LICS.1988.5137

P. No14-]-robin, C. Neatherway, and . Ong, Travmc2: higher-order model checking for alternating parity tree automata, 2014 International Symposium on Model Checking of Software, SPIN, pp.129-132, 2014.

P. Nro12-]-robin, S. J. Neatherway, C. Ramsay, and . Ong, A traversal-based algorithm for higher-order model checking, ICFP '12, pp.353-364, 2012.

]. Ong and . Ong, On model-checking trees generated by higherorder recursion schemes (long version)

]. Ong06 and . Ong, On model-checking trees generated by higherorder recursion schemes, LICS '06, pp.81-90, 2006.

]. Ong15 and . Ong, Normalisation by traversals. CoRR, abs, 1511.

[. Ong and T. Tsukada, Two-Level Game Semantics, Intersection Types, and Recursion Schemes, LNCS, vol.7392, issue.12, pp.325-336, 2012.
DOI : 10.1007/978-3-642-31585-5_31

P. Parys, On the Significance of the Collapse Operation, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.521-530
DOI : 10.1109/LICS.2012.62

]. G. Plo75 and . Plotkin, Call-by-name, call-by-value and the ?-calculus, Theoretical Computer Science, vol.1, issue.2, pp.125-159, 1975.

[. Petricek, D. A. Orchard, and A. Mycroft, Coeffects: a calculus of context-dependent computation, ICFP, p.2014

J. Queille and J. Sifakis, Specification and verification of concurrent systems in CESAR, International Symposium on Programming '82, pp.337-351, 1982.
DOI : 10.1007/3-540-11494-7_22

O. Michael and . Rabin, Decidability of second-order theories and automata on infinite trees, Transactions of the AMS, vol.141, issue.38, pp.1-35, 1969.

[. Ramsay, Intersection Types and Higher-Order Model Checking URL: https, 2013.

. Johnc and . Reynolds, The discoveries of continuations, LISP and Symbolic Computation, vol.6, pp.3-4233, 1993.

D. Rémy, Type systems for programming languages. MPRI lecture notes URL: http://gallium.inria.fr/~remy/mpri, 2013.

[. Salvati, Recognizability in the simply typed lambdacalculus, LNCS, vol.5514, issue.28, pp.48-60, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00412654

[. Salvati, On the Membership Problem for Non-Linear Abstract Categorial Grammars, Journal of Logic, Language and Information, vol.10, issue.1, pp.163-183, 2010.
DOI : 10.1007/s10849-009-9110-0

URL : https://hal.archives-ouvertes.fr/hal-00306230

L. Santocanale, A calculus of circular proofs and its categorical semantics, Nielsen and Engberg [NE02], pp.357-371
URL : https://hal.archives-ouvertes.fr/hal-01261170

D. Sangiorgi, On the origins of bisimulation and coinduction, ACM Trans. Program. Lang. Syst, vol.31, issue.4, 2009.

S. Schewe, Solving parity games in big steps, FSTTCS '07, pp.449-460, 2007.
DOI : 10.1016/j.jcss.2016.10.002

P. Severi and F. Vries, An extensional böhm model, LNCS, vol.2378, pp.159-173, 2002.

]. R. See89 and . Seely, Linear logic, *-autonomous categories and cofree coalgebras, Categories in Computer Science and Logic, pp.371-382, 1989.

[. Serre, Playing with Trees and Logic. Habilitation à diriger des recherches, p.68, 2013.
URL : https://hal.archives-ouvertes.fr/tel-01260775

A. K. Simpson and G. D. Plotkin, Complete axioms for categorical fixed-point operators, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), pp.30-41, 2000.
DOI : 10.1109/LICS.2000.855753

]. R. Sta02 and . Statman, On the lambda y calculus, LICS '02, pp.159-166, 2002.

A. Seth and N. K. Vishnoi, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik URL: http://drops.dagstuhl.de/portals/ extern/index.php?semnr=13018, FSTTCS '13, pp.285-292, 2013.

B. Salvati and I. Walukiewicz, Krivine machines and higher-order schemes, Luca Aceto, Monika Henzinger, and Jirí Sgall, pp.162-173, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01121744

S. Salvati and I. Walukiewicz, Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata, LNCS, vol.7550, issue.257, pp.6-20978, 2012.
DOI : 10.1007/978-3-642-33512-9_2

URL : https://hal.archives-ouvertes.fr/hal-00717718

[. Salvati and I. Walukiewicz, Evaluation is msolcompatible, Seth and Vishnoi [SV13], pp.103-114

[. Salvati and I. Walukiewicz, Using models to modelcheck recursive schemes, TLCA '13, pp.189-204978, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00741077

[. Salvati and I. Walukiewicz, Krivine machines and higher-order schemes, Information and Computation, vol.239, issue.274, pp.340-355, 2014.
DOI : 10.1016/j.ic.2014.07.012

URL : https://hal.archives-ouvertes.fr/hal-01121744

[. Salvati and I. Walukiewicz, A model for behavioural properties of higher-order programs, Kreutzer [Kre15], pp.229-243
URL : https://hal.archives-ouvertes.fr/hal-01145494

[. Salvati and I. Walukiewicz, Typing Weak MSOL Properties, Pitts [Pit15], pp.343-357978
DOI : 10.1007/978-3-662-46678-0_22

URL : https://hal.archives-ouvertes.fr/hal-01394824

W. W. Tait, Intensional interpretations of functionals of finite type i. The Journal of Symbolic Logic, pp.198-212, 1967.

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, pp.285-309, 1955.
DOI : 10.2140/pjm.1955.5.285

K. Terui, Semantic evaluation, intersection types and complexity of simply typed lambda calculus Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, LIPIcs, vol.15, issue.277, pp.323-338, 2012.

T. Tsukada and C. Ong, Compositional higher-order model checking via ?-regular games over böhm trees (long version)

T. Tsukada and C. Ong, Compositional higherorder model checking via ?-regular games over böhm trees, CSL-LICS '14, pp.1-7810, 2014.

]. A. Tur37 and . Turing, The p-function in ? ? K-conversion, Journal of Symbolic Logic, vol.2, issue.4, pp.164-164, 1937.

]. C. Wad71 and . Wadsworth, Semantics and Pragmatics of the Lambdacalculus URL: https://books. google.de/books?id=kl1QIQAACAAJ, 1971.

I. Walukiewicz, Completeness of kozen's axiomatisation of the propositional mu-calculus, LICS '95, pp.14-24, 1995.

I. Walukiewicz, Pushdown Processes: Games and Model Checking, CAV '96, pp.62-74, 1996.
DOI : 10.7146/brics.v3i54.20057

[. Walukiewicz, Pushdown Processes: Games and Model-Checking, Information and Computation, vol.164, issue.2, pp.234-263, 2001.
DOI : 10.1006/inco.2000.2894

[. Wilke, Alternating tree automata, parity games, and modal µ-calculus, Bull. Belg. Math. Soc. Simon Stevin, vol.8, issue.51, pp.359-391, 2001.

G. Winskel, A Linear Metalanguage for Concurrency, AMAST '98, 1998.
DOI : 10.7146/brics.v5i31.19437

[. Zielonka, Infinite games on finitely coloured graphs with applications to automata on infinite trees, Theoretical Computer Science, vol.200, issue.1-2, pp.135-183, 1998.
DOI : 10.1016/S0304-3975(98)00009-7