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

S. Abramsky and R. Jagadeesan, Abstract, The Journal of Symbolic Logic, vol.417, issue.02, pp.543-574, 1994.
DOI : 10.1007/BF01622878

K. Aehlig, A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata, In: Logical Methods in Computer Science, vol.31, pp.1-23, 2007.

K. Aehlig, J. De-miranda, and C. Ong, Safety Is not a Restriction at Level 2 for String Languages, Ed. by V. Sassone. Lecture Notes in Computer Science, vol.3441, pp.490-504, 2005.
DOI : 10.1007/978-3-540-31982-5_31

A. V. Aho, Indexed Grammars -An Extension of Context-Free Grammars, J. ACM, vol.154, pp.647-671, 1968.

A. V. Aho, Nested Stack Automata, Journal of the ACM, vol.16, issue.3, pp.383-406, 1969.
DOI : 10.1145/321526.321529

M. Amblard, Calculs de représentations s'emantique et syntaxe générative : les grammaires minimalistes catégorielles, 2007.

M. T. Aravind, K. Leon, and S. Levy, Tree Adjunct Grammars, Journal of Computer and System Sciences, vol.10, issue.1, pp.136-163, 1975.

A. Arnold and D. Niwiski, Rudiments of µ-calculus, Studies in Logic and the Foundations of Mathematics. Noth-Holland, 2001.

A. Arnold and M. Dauchet, Théorie des magmodes, 1978.

F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman, Magic sets and other strange ways to implement logic programs, pp.5-6, 1985.

H. P. Barendregt, The Lambda Calculus: Its Syntax and Semantics, Studies in Logic and the Foundations of Mathematics, 1984.

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

T. Becker, O. Rambow, and M. Niv, The Derivational Generative Power of Formal Systems or Scrambling is beyond LCFRS, 1992.

H. Beki, Definable operations in general algebras, Tech. rep. IBM Laboratories, 1969.

D. Bekki, Representing Anaphora with Dependent Types, Logical Aspects of Computational Linguistics -8th International Conference Proceedings, pp.14-29, 2014.
DOI : 10.1007/978-3-662-43742-1_2

D. Bekki, E. Mccready, L. , J. , G. Kanagawa et al., CI via DTS, New Frontiers in Artificial Intelligence -JSAI-isAI 2014 Workshops, pp.23-36, 2014.
DOI : 10.1007/978-3-662-48119-6_3

J. Van-benthem, Language in action, Journal of Philosophical Logic, vol.7, issue.3, 1995.
DOI : 10.1007/BF00250539

G. Berry and P. Curien, Sequential algorithms on concrete data structures, Theoretical Computer Science, vol.20, issue.3, pp.265-321, 1982.
DOI : 10.1016/S0304-3975(82)80002-9

G. Berry, Stable Models of Typed lambda-Calculi, Proceedings of the Fifth Colloquium on Automata, Languages and Programming, pp.72-89, 1978.

S. L. Bloom and Z. Ésik, Fixed-point operations on ccc's. Part I, Theoretical Computer Science, vol.155, issue.1, pp.1-38, 1996.
DOI : 10.1016/0304-3975(95)00010-0

W. Blum and C. L. Ong, The safe lambda calculus, In: Logical Methods in Computer Science, vol.51, pp.3-4, 2009.

A. Blumensath, Recognisability for algebras of infinite trees, Theoretical Computer Science, vol.412, issue.29, pp.3463-3486, 2011.
DOI : 10.1016/j.tcs.2011.02.037

F. Bobot, J. Filliâtre, C. Marché, G. Melquiond, and A. Paskevich, The Why3 platform, version 0, 2015.

F. Bobot, J. Filliâtre, C. Marché, and A. Paskevich, Why3: Shepherd Your Herd of Provers, Boogie 2011: First International Workshop on Intermediate Verification Languages. Wrocaw, pp.53-64, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00790310

M. Bojaczyk, Weak MSO with the Unbounding Quantifier, Theory of Computing Systems, vol.17, issue.3, pp.554-576, 2011.
DOI : 10.1007/s00224-010-9279-2

W. S. Brainerd, The minimalization of tree automata, Information and Control, vol.13, issue.5, pp.484-491, 1968.
DOI : 10.1016/S0019-9958(68)90917-0

W. S. Brainerd, Tree generating regular systems, Information and Control, vol.14, issue.2, pp.217-231, 1969.
DOI : 10.1016/S0019-9958(69)90065-5

J. Bresnan, Lexical-Functional Syntax. Blackwell Textbooks in Linguistics, 2001.

C. H. Broadbent, A. Carayol, C. 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 and C. L. Ong, On Global Model Checking Trees Generated by Higher-Order Recursion Schemes, FOSSACS. LNCS 5504, pp.107-121, 2009.
DOI : 10.1016/S0020-0190(02)00445-3

S. D. Brookes and S. Geva, Sequential functions on indexed domains and full abstraction for a sub-language of PCF, Mathematical Foundations of Programming Semantics, 9th International Conference, pp.320-332, 1993.
DOI : 10.1007/3-540-58027-1_16

A. Bucciarelli and T. Ehrhard, Sequentiality in an Extensional Framework, Information and Computation, vol.110, issue.2, pp.265-296, 1994.
DOI : 10.1006/inco.1994.1033
URL : https://hal.archives-ouvertes.fr/hal-00527028

A. Bucciarelli, T. Ehrhard, and G. Manzonetto, A relational semantics for parallelism and non-determinism in a functional setting, Annals of Pure and Applied Logic, vol.163, issue.7, pp.918-934, 2012.
DOI : 10.1016/j.apal.2011.09.008
URL : https://hal.archives-ouvertes.fr/hal-00707776

J. R. Büchi, Weak Second-Order Arithmetic and Finite Automata, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.9, issue.1-6, pp.1-6, 1960.
DOI : 10.1002/malq.19600060105

J. Buchi, Using Determinancy of Games to Eliminate Quantifiers In: Fundamentals of Computation Theory, Lecture Notes in Computer Science, pp.367-378, 1977.

G. L. Burn, C. Hankin, and S. Abramsky, Strictness analysis for higher-order functions, Science of Computer Programming, vol.7, issue.3, pp.249-278, 1986.
DOI : 10.1016/0167-6423(86)90010-9

S. Chatzikyriakidis and Z. Luo, Natural Language Inference in Coq, Journal of Logic, Language and Information, vol.79, issue.1, pp.441-480, 2014.
DOI : 10.1007/s10849-014-9208-x

N. Chomsky, Aspects of the theory of syntax Cambridge, In: Multilingual Matters, 1965.

N. Chomsky, Lectures on government and binding: The Pisa lectures. 9, 1993.
DOI : 10.1515/9783110884166

N. Chomsky, Syntactic Structures, 1957.
DOI : 10.1515/9783110218329

N. Chomsky, The minimalist program, 1995.
DOI : 10.7551/mitpress/9780262527347.001.0001

A. Church, The calculi of Lambda Conversion, 1941.

A. Church, A formulation of the simple theory of types, The Journal of Symbolic Logic, vol.1, issue.02, pp.56-68, 1940.
DOI : 10.2307/2371199

A. Church and J. B. Rosser, Some properties of conversion, Transactions of the American Mathematical Society, vol.39, issue.3, pp.472-482, 1936.
DOI : 10.1090/S0002-9947-1936-1501858-0

P. Cohn, Universal Algebra, 1981.

H. Comon and Y. Jurski, Higher-order matching and tree automata, pp.157-176, 1997.
DOI : 10.1007/BFb0028013

D. J. Weir-supervisor-aravind and K. Joshi, Characterizing mildly context-sensitive grammar formalisms, 1988.

B. Courcelle, A representation of trees by languages I, Theoretical Computer Science, vol.6, issue.3, pp.255-279, 1978.
DOI : 10.1016/0304-3975(78)90008-7

B. Courcelle, An axiomatic definition of context-free rewriting and its application to NLC graph grammars, In: Theoretical Computer Science, vol.55, pp.2-3, 1987.

B. Courcelle, Monadic second-order definable graph transductions: a survey, Theoretical Computer Science, vol.126, issue.1, pp.53-75, 1994.
DOI : 10.1016/0304-3975(94)90268-2

B. Courcelle, On Recognizable Sets and Tree Automata, Resolution of equations in algebraic structures 1, pp.93-126, 1989.
DOI : 10.1016/B978-0-12-046370-1.50009-7

B. Courcelle, The monadic second-order logic of graphs IX: Machines and their behaviours, Theoretical Computer Science, vol.151, issue.1, pp.125-162, 1995.
DOI : 10.1016/0304-3975(95)00049-3

B. Courcelle and I. Durand, Automata for the verification of monadic second-order graph properties, Journal of Applied Logic, vol.10, issue.4, pp.368-409, 2012.
DOI : 10.1016/j.jal.2011.07.001
URL : https://hal.archives-ouvertes.fr/hal-00611853

B. Courcelle and J. Engelfriet, A logical characterization of the sets of hypergraphs defined by Hyperedge Replacement grammars, Mathematical Systems Theory, vol.2, issue.6, pp.515-552, 1995.
DOI : 10.1007/BF01204169

B. Courcelle and J. Engelfriet, Graph Structure and Monadic Second- Order Logic -A Language-Theoretic Approach Encyclopedia of mathematics and its applications, 2012.

B. Courcelle and T. Knapik, The evaluation of first-order substitution is monadic second-order compatible, Theoretical Computer Science, vol.281, issue.1-2, pp.177-206, 2002.
DOI : 10.1016/S0304-3975(02)00012-9

B. Courcelle and I. Walukiewicz, Monadic second-order logic, graph coverings and unfoldings of transition systems, Annals of Pure and Applied Logic, vol.92, issue.1, pp.35-62, 1998.
DOI : 10.1016/S0168-0072(97)00048-1

P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.238-252, 1977.
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/hal-01108790

A. B. Cremers and O. Mayer, On vector languages, Journal of Computer and System Sciences, vol.8, issue.2, pp.158-166, 1974.
DOI : 10.1016/S0022-0000(74)80053-X

P. Curien, G. D. Plotkin, and G. Winskel, Bistructures, Bidomains and Linear Logic, BRICS Report Series, vol.4, issue.15, pp.21-54, 2000.
DOI : 10.7146/brics.v4i15.18805

H. B. Curry, Some logical aspects of grammatical structure, Ed. by R. Jakobson . AMS Bookstore, pp.56-68, 1961.
DOI : 10.1090/psapm/012/9981

L. Damas, Type Assignment in Programming Languages, 1985.

L. Damas and R. Milner, Principal type-schemes for functional programs, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '82, pp.207-212, 1982.
DOI : 10.1145/582153.582176

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

W. Damm and E. Fehr, A schematalogical approach to the alalysis of the procedure concept in algol-languages, Proc. 5eme Colleque de Lille sur les Arbres en Algebre et en Programmation, pp.22-23, 1980.

W. Damm and A. Goerdt, An automata-theoretical characterization of the OI-hierarchy, Information and Control, vol.71, issue.1-2, pp.1-32, 1986.
DOI : 10.1016/S0019-9958(86)80016-X

P. De-groote and S. Pogodalla, On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms, Journal of Logic, Language and Information, vol.223, issue.4, pp.421-438, 2005.
DOI : 10.1007/s10849-004-2114-x
URL : https://hal.archives-ouvertes.fr/inria-00112956

M. Dezani-ciancaglini, E. Giovannetti, and U. De-'liguoro, Intersection Types, Lambda-models and Böhm Trees Theories of Types and Proofs, MSJ-Memoir, vol.2, issue.2, pp.45-97, 1998.

L. E. Dickson and . English, Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors, American Journal of Mathematics, vol.35, issue.4, pp.413-422, 1913.
DOI : 10.2307/2370405

J. Doner, Tree acceptors and some of their applications, Journal of Computer and System Sciences, vol.4, issue.5, pp.406-451, 1970.
DOI : 10.1016/S0022-0000(70)80041-1

J. E. Doner, Decidability of the weak second-order theory of two successors, In: Notices Amer. Math. Soc, vol.12, pp.365-468, 1965.

J. Earley, An efficient context-free parsing algorithm, Communications of the ACM, vol.13, issue.2, pp.94-102, 1970.
DOI : 10.1145/362007.362035

T. Ehrhard, Hypercoherences: A Strongly Stable Model of Linear Logic, In: Mathematical Structures in Computer Science, vol.34, pp.365-385, 1993.
URL : https://hal.archives-ouvertes.fr/hal-00527026

T. Ehrhard, Projecting sequential algorithms on strongly stable functions, Annals of Pure and Applied Logic, vol.77, issue.3, pp.201-244, 1996.
DOI : 10.1016/0168-0072(95)00026-7
URL : https://hal.archives-ouvertes.fr/hal-00527033

S. Eilenberg and J. B. Wright, Automata in general algebras, Information and Control, vol.11, issue.4, pp.452-470, 1967.
DOI : 10.1016/S0019-9958(67)90670-5

C. C. Elgot, Algebraic theories and program schemes, In: Symposium on Semantics of Algorithmic Languages. Lecture Notes in Mathematics, vol.188, pp.71-88, 1971.
DOI : 10.1007/BFb0059694

C. C. Elgot, Decision problems of finite automata design and related arithmetics, Transactions of the, pp.21-51, 1961.
DOI : 10.1090/S0002-9947-1961-0139530-9

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

J. Engelfriet, Bottom-up and top-down tree transformations??? a comparison, Mathematical Systems Theory, vol.2, issue.2, pp.198-231, 1975.
DOI : 10.1007/BF01704020

J. Engelfriet, Iterated stack automata and complexity classes, Information and Computation, vol.95, issue.1, pp.21-75, 1991.
DOI : 10.1016/0890-5401(91)90015-T
URL : http://doi.org/10.1016/0890-5401(91)90015-t

J. Engelfriet, The Complexity of Languages Generated by Attribute Grammars, SIAM Journal on Computing, vol.15, issue.1, pp.70-86, 1986.
DOI : 10.1137/0215005

J. Engelfriet and L. Heyker, The string generating power of context-free hypergraph grammars, Journal of Computer and System Sciences, vol.43, issue.2, pp.328-360, 1991.
DOI : 10.1016/0022-0000(91)90018-Z

J. Engelfriet and E. M. Schmidt, 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

J. Engelfriet and E. M. Schnidt, IO and OI. II, Journal of computer and system sciences, pp.67-99, 1978.
DOI : 10.1016/0022-0000(78)90051-X

J. Engelfriet and S. Skyum, Copying Theorems, Inf. Process. Lett, vol.46, pp.157-161, 1976.

J. Engelfriet and H. Vogler, Macro tree transducers, Journal of Computer and System Sciences, vol.31, issue.1, pp.71-146, 1985.
DOI : 10.1016/0022-0000(85)90066-2

Z. Ésik, Algebras of iteration theories, Journal of Computer and System Sciences, vol.27, issue.2, pp.291-303, 1983.
DOI : 10.1016/0022-0000(83)90044-2

A. Ferguson and J. Hughes, Fast abstract interpretation using sequential algorithms, Static Analysis, Third International Workshop , WSA'93, pp.45-59, 1993.
DOI : 10.1007/3-540-57264-3_28

M. J. Fischer, Grammars with macro-like productions, 9th Annual Symposium on Switching and Automata Theory (swat 1968), 1968.
DOI : 10.1109/SWAT.1968.12

M. J. Fischer and A. L. Rosenberg, Real-time solutions of the origin-crossing problem, Mathematical Systems Theory, pp.257-263, 1968.
DOI : 10.1007/BF01694010

T. Freeman and F. Pfenning, Refinement types for ML, ACM SIGPLAN Notices, vol.26, issue.6, pp.268-277, 1991.
DOI : 10.1145/113446.113468

H. and F. English, Equality between functionals In: Logic Colloquium, Lecture Notes in Mathematics, vol.453

G. Gazdar, J. Klein, G. Pullum, and I. Sag, Generalized Phrase Structure Grammar, 1985.

G. Gazdar, Phrase structure grammar In: The nature of syntactic representation, pp.131-186, 1982.

S. Ginsburg, S. Greibach, and J. Hopcroft, Studies in abstract families of languages, Memoirs of the American Mathematical Society, vol.0, issue.87, 1969.
DOI : 10.1090/memo/0087

S. Ginsburg and E. H. Spanier, AFL with the semilinear property, Journal of Computer and System Sciences, vol.5, issue.4, pp.365-396, 1971.
DOI : 10.1016/S0022-0000(71)80024-7

J. Girard, The system F of variable types, fifteen years later, Theoretical Computer Science, vol.45, issue.2, pp.159-192, 1986.
DOI : 10.1016/0304-3975(86)90044-7

J. Girard, Interprétation fonctionnelle et élimination des coupures dans l'arithmétique d'ordre supérieur, Thèse de doctorat d'état, 1972.

C. Gómez-rodrguez, M. Kuhlmann, and G. Satta, Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems, Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics, Proceedings, pp.276-284, 2010.

S. A. Greibach, Hierarchy theorems for two-way finite state transducers, Acta Informatica, vol.11, issue.1, pp.80-101, 1978.
DOI : 10.1007/BF00264603

S. A. Greibach, One way finite visit automata, Theoretical Computer Science, vol.6, issue.2, pp.175-221, 1978.
DOI : 10.1016/0304-3975(78)90035-X

C. Grellois and P. Melliès, An Infinitary Model of Linear Logic, FoSSaCS 2015, pp.41-55, 2015.
DOI : 10.1007/978-3-662-46678-0_3

C. Grellois and P. Melliès, Finitary semantics of linear logic and higherorder model-checking, pp.1502-05147, 2015.

C. Grellois and P. Melliès, Indexed linear logic and higher-order model checking, Proceedings Seventh Workshop on Intersection Types and Related Systems, pp.43-52, 2014.
DOI : 10.4204/EPTCS.177.4

A. V. Groenink, Surface without Structure, 1997.

P. De-groote, Towards a Montagovian Account of Dynamics, Proceedings of Semantics in Linguistic Theory XVI. CLC Publications, 2007.

P. De-groote, Towards abstract categorial grammars, Proceedings of the 39th Annual Meeting on Association for Computational Linguistics , ACL '01
DOI : 10.3115/1073012.1073045
URL : https://hal.archives-ouvertes.fr/inria-00100529

P. De-groote and E. Lebedeva, On the Dynamics of Proper Names, 2010.

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

L. Henkin, Completeness in the theory of types, The Journal of Symbolic Logic, vol.14, issue.02, pp.81-91, 1950.
DOI : 10.1007/BF01696781

G. G. Hillebrand, Finite Model Theory in the Simply Typed Lambda Calculus, 1994.

R. Hindley, The Principal Type-Scheme of an Object in Combinatory Logic, Transactions of the American Mathematical Society, vol.146, pp.29-60, 1969.
DOI : 10.2307/1995158

G. Hotz and G. Pitsch, On parsing coupled-context-free languages, Theoretical Computer Science, vol.161, issue.1-2, pp.205-253, 1996.
DOI : 10.1016/0304-3975(95)00114-X

]. G. Huet, Résolution d'équations dans des langages d'ordre 1, Thèse de Doctorat es Sciences Mathématiques, 1976.

R. Huybregts, The weak inadequacy of context-free phrase structure grammars, pp.81-99, 1984.

J. M. Hyland and C. L. Ong, On Full Abstraction for PCF: I, II, and III, Information and Computation, vol.163, issue.2, pp.285-408, 2000.
DOI : 10.1006/inco.2000.2917

D. Janin and I. Walukiewicz, On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
DOI : 10.1007/3-540-61604-7_60

. Sassone, Lecture Notes in Computer Science, pp.263-277, 1996.

T. Jensen, Abstract Interpretation in Logical Form, 1992.

A. Joshi and Y. Schabes, Tree-Adjoining Grammars, 1997.
DOI : 10.1007/978-3-642-59126-6_2

A. K. Joshi, Tree-Adjoining Grammars, pp.206-250, 1985.
DOI : 10.1007/978-3-642-59126-6_2

A. K. Joshi, L. S. Levy, and M. Takahashi, Tree adjunct grammars, Journal of Computer and System Sciences, vol.10, issue.1, pp.136-163, 1975.
DOI : 10.1016/S0022-0000(75)80019-5

A. K. Joshi, V. K. Shanker, D. J. Weir, T. Shieber, and . Wasow, The converence of Mildly Context-Sensitive Grammar Formalisms " . In: Foundational Issues in Natural Language Processing, pp.31-81, 1991.

J. Jourdan, V. Laporte, S. Blazy, X. Leroy, and D. Pichardie, A Formally- Verified C Static Analyzer, Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages , POPL 2015, pp.247-259, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01078386

G. Kahn and G. D. Plotkin, Concrete domains, Theoretical Computer Science, vol.121, issue.1-2, pp.1-2, 1993.
DOI : 10.1016/0304-3975(93)90090-G

M. Kanazawa, The failure of Ogden's lemma for well-nested multiple context-free languages

M. Kanazawa, A prefix-correct Earley recognizer for multiple contextfree grammars, Proceedings of the Ninth International Workshop on Tree Adjoining Grammars and Related Formalisms, pp.49-56, 2008.

M. Kanazawa, Parsing and generation as Datalog queries, Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics, pp.176-183, 2007.

M. Kanazawa, Second-Order ACGs as Hyperedge Replacement Grammars, Workshop on New Directions in Type-theoretic Grammars (NDTTG), 2007.

M. Kanazawa, The convergence of well-nested mildly context-sensitive grammar formalisms " . Invited Talk at The 14th conference on Formal Grammar, FG, 2009.

M. Kanazawa, The Pumping Lemma for Well-Nested Multiple Context-Free Languages, LNCS, vol.88, issue.2, pp.312-325, 2009.
DOI : 10.1515/9781400882007

M. Kandulski, The equivalence of Nonassociative Lambek Categorial Grammars and Context-Free Grammars, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.14, issue.1, pp.41-52, 1988.
DOI : 10.1002/malq.19880340106

T. Kasami, An efficient recognition and syntax-analysis algorithm for context-free languages, 1965.

J. Kirman and S. Salvati, On the Complexity of Free Word Orders, Proceedings. 2013, pp.209-224, 2012.
DOI : 10.1007/978-3-642-39998-5_13
URL : https://hal.archives-ouvertes.fr/hal-00945516

N. Klarlund and A. Møller, MONA Version 1.4 User Manual. Notes Series NS-01-1. Available from http://www.brics.dk/mona/. Revision of BRICS NS-98-3, 2001.

S. C. Kleene, Representation of Events in Nerve Nets and Finite Automata, Annals of Mathematics Studies, vol.34, pp.3-42, 1956.
DOI : 10.1515/9781400882618-002

S. C. Kleene, Representation of Events in Nerve Nets and Finite Automata, 1951.
DOI : 10.1515/9781400882618-002

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

T. Knapik, D. Niwinski, and P. Urzyczyn, Higher-Order Pushdown Trees Are Easy, pp.205-222, 2002.
DOI : 10.1007/3-540-45931-6_15

T. Knapik, D. Niwinski, P. Urzycyzn, and I. Walukiewicz, Unsafe Grammars and Panic Automata, ICALP 05. Ed. by Springer, pp.1450-1461, 2005.
DOI : 10.1007/11523468_117
URL : https://hal.archives-ouvertes.fr/hal-00335729

]. T. Knapik, D. Niwinski, and P. Urzyczyn, Higher-Order Pushdown Trees Are Easy, Proc. FoSSaCS'02, pp.205-222, 2002.
DOI : 10.1007/3-540-45931-6_15

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

N. Kobayashi, Types and Recursion Schemes for Higher-Order Program Verification, In: APLAS. LNCS, vol.5904, pp.2-3, 2009.
DOI : 10.1007/978-3-642-10672-9_2

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

G. M. Kobele, Idioms and extended transducers, Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+11). 2012, pp.153-161

G. M. Kobele, Generating Copies: An Investigation into Structural Identity in Language and Grammar, 2006.

H. Kolb, J. Michaelis, U. Mönnich, and F. Morawietz, An operational and denotational approach to non-context-freeness, Theoretical Computer Science, vol.293, issue.2, pp.261-289, 2003.
DOI : 10.1016/S0304-3975(01)00348-6

M. Kracht, Studies in Generative Grammar, The Mathematics of Language, vol.63, 2003.

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

M. T. Kromann, The Danish Dependency Treebank and the DTAG treebank tool, Proceedings of the Second Workshop on Treebanks and Linguistic Theories, pp.14-15, 2003.

M. Kuhlmann and M. Möhl, Mildly Context-Sensitive Dependency Languages, Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics, 2007.

M. Kuhlmann and M. Möhl, The string-generative capacity of regular dependency languages, 2007.

M. Kuhlmann and J. Nivre, Mildly non-projective dependency structures, Proceedings of the COLING/ACL on Main conference poster sessions -, pp.17-21, 2006.
DOI : 10.3115/1273073.1273139

J. Laird, A Fully Abstract Bidomain Model of Unary FPC, Lecture Notes in Computer Science, vol.2701, pp.211-225, 2003.
DOI : 10.1007/3-540-44904-3_15

J. Laird, Games and Sequential Algorithms. Unpublished note, 2001.

F. Lamarche, Sequentiality, games and linear logic, 1992.

J. Lambek, On the calculus of syntactic types, Proceedings of the 12th Symposium of Applied Mathematics. Ed. by R. Jakobson, pp.166-178, 1961.
DOI : 10.1090/psapm/012/9972

J. Lambek, The Mathematics of Sentence Structure, The American Mathematical Monthly, vol.65, issue.3, pp.154-170, 1958.
DOI : 10.2307/2310058

M. Latteux, C??nes rationnels commutativement clos, RAIRO. Informatique th??orique, vol.11, issue.1, pp.29-51, 1977.
DOI : 10.1051/ita/1977110100291

F. W. Lawvere, FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES, Proceedings of the National Academy of Sciences, vol.50, issue.5, 1963.
DOI : 10.1073/pnas.50.5.869

A. Lecomte, A Computational Approach to Minimalism, Proceedings of ICON-2003, International Conference on Natural Language. Central Institute of Indian Languages, pp.20-31, 2003.

A. Lecomte, Derivations as Proofs : a Logical Approach to Minimalism, Proceedings of CG 2004, 2004.

A. Lecomte and C. Retoré, Extending Lambek grammars, Proceedings of the 39th Annual Meeting on Association for Computational Linguistics , ACL '01, pp.354-361, 2001.
DOI : 10.3115/1073012.1073059

A. Lecomte and C. Retoré, Towards a Minimal Logic for Minimalist Grammars: a tranformational use of Lambek calculus, Formal Grammar 99, 1999.

R. Loader, Finitary PCF is not decidable, Theoretical Computer Science, vol.266, issue.1-2, pp.341-364, 2001.
DOI : 10.1016/S0304-3975(00)00194-8

R. Loader, The Undecidability of ??-Definability, pp.331-342, 2001.
DOI : 10.1007/978-94-010-0526-5_15

Z. Manna, Mathematical Theory of Computation, 1974.

Z. Manna, The correctness of programs, Journal of Computer and System Sciences, vol.3, issue.2, pp.119-127, 1969.
DOI : 10.1016/S0022-0000(69)80009-7

A. N. Maslov, Multilevel Stack Automata, pp.55-62, 1976.

A. Maslov, The hierarchy of indexed languages of an arbitrary level, In: Soviet Math. Dokl, vol.15, issue.4, pp.1170-1174, 1974.

J. Mezei and J. Wright, Algebraic automata and context-free sets, Information and Control, vol.11, issue.1-2, pp.3-29, 1967.
DOI : 10.1016/S0019-9958(67)90353-1

J. Michaelis and M. K. English, Semilinearity as a syntactic invariant, C. Retoré. Lecture Notes in Computer Science, vol.1328, pp.329-345, 1997.
DOI : 10.1007/BFb0052165

R. and M. English, LCF: A way of doing proofs with a machine, Mathematical Foundations of Computer Science J. Bevá. Lecture Notes in Computer Science, vol.74, pp.146-159, 1979.

R. Milner, Models of LCF. Tech. rep. Memo AIM-186, 1973.

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

J. G. De-miranda, Structures Generated by Higher-Order Grammars and the Safety Constraint, 2006.

R. Montague, Formal Philosophy: Selected Papers of Richard Montague, 1974.

F. Morawietz, Two-Step Approaches ot Natural Language Formalisms. Studies in Generative Grammar, 2003.

A. A. Muchnik, Games on Infinite Trees and Automata with Dead Ends, Semiotics and Information, pp.17-44, 1984.

D. E. Muller and P. E. Schupp, The theory of ends, pushdown automata, and second-order logic, Theoretical Computer Science, vol.37, pp.51-75, 1985.
DOI : 10.1016/0304-3975(85)90087-8

D. E. Muller, A. Saoudi, and P. E. Schupp, Alternating automata, the weak monadic theory of the tree, and its complexity, Automata, Languages and Programming, pp.275-283, 1986.
DOI : 10.1007/3-540-16761-7_77

D. E. Muller, A. Saoudi, and P. E. Schupp, Alternating automata, the weak monadic theory of trees and its complexity, Theoretical Computer Science, vol.97, issue.2, pp.233-244, 1992.
DOI : 10.1016/0304-3975(92)90076-R

R. Muskens, Lambda Grammars and the Syntax-Semantics Interface " . In: Proceedings of the Thirteenth Amsterdam Colloquium, Stokhof. Amsterdam, pp.150-155, 2001.

J. Myhill, Finite automata and the representation of events, 1957.

M. Nederhof, Generalized left-corner parsing, Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics -, pp.305-314, 1993.
DOI : 10.3115/976744.976780

M. Nederhof, The computational complexity of the correct-prefix property for TAGs, In: Comput. Linguist, vol.253, pp.345-360, 1999.

A. Nerode, Linear automaton transformations, Proceedings of the American Mathematical Society, vol.9, issue.4, pp.541-544, 1958.
DOI : 10.1090/S0002-9939-1958-0135681-9

M. Nivat, On the interpretation of recursive polyadic program schemes, In: Symp. Mathematica, vol.15, pp.255-281, 1975.

M. Nivat, Transductions des langages de Chomsky, Thèse d'état. Annales de l'institut Fourier, 1968.
DOI : 10.5802/aif.287

W. Ogden, A helpful result for proving inherent ambiguity, Theory of Computing Systems, pp.191-194, 1968.
DOI : 10.1007/BF01694004

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.12-15, 2006.
DOI : 10.1109/LICS.2006.38

V. Padovani, Decidability of all minimal models, Types for Proofs and Programs, International Workshop TYPES'95, pp.201-215, 1995.
DOI : 10.1007/3-540-61780-9_71
URL : https://hal.archives-ouvertes.fr/hal-00527844

V. Padovani, Decidability of fourth-order matching, Mathematical Structures in Computer Science, vol.10, issue.3, pp.361-372, 2000.
DOI : 10.1017/S0960129500003108
URL : https://hal.archives-ouvertes.fr/hal-00527853

V. Padovani, Filtrage d'odre supérieur, Thèse de doctorat, 1994.

M. A. Palis and S. M. Shende, Pumping lemmas for the control language hierarchy, Mathematical System Theory, pp.199-213, 1995.
DOI : 10.1007/BF01303055

B. H. Partee, Montague, Richard (1930???1971), Ed. by K. Brown, vol.8, pp.255-257, 2006.
DOI : 10.1016/B0-08-044854-2/02760-7

P. Parys, Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata, 28th International Symposium on Theoretical Aspects of Computer Science, pp.603-614, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00573593

M. Pentus, Lambek grammars are context free, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science, pp.429-433, 1993.
DOI : 10.1109/LICS.1993.287565

P. S. Peters and R. W. Ritchie, On the generative power of transformational grammars, Information Sciences, vol.6, pp.49-83, 1973.
DOI : 10.1016/0020-0255(73)90027-3

G. Plotkin and H. B. , Lambda-definability and logical relationsCurry : essays on combinatory logic, lambda calculus, and formalism, pp.363-373, 1980.

G. D. Plotkin, LCF considered as a programming language, Theoretical Computer Science, vol.5, issue.3, pp.223-255, 1977.
DOI : 10.1016/0304-3975(77)90044-5

C. Pollard and I. A. Sag, Head-driven phrase structure grammar, 1994.

G. K. Pullum and G. G. , Natural languages and context-free languages, Linguistics and Philosophy, vol.70, issue.3, pp.471-504, 1982.
DOI : 10.1007/BF00360802

P. C. Amadio, Domains and lambda-calculi. Cambridge Tracts in Theoretical Computer Science 46, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00070008

M. O. Rabin, Decidability of Second-Order Theories and Automata on Infinite Trees, In: Transactions of the AMS, vol.141, pp.1-23, 1969.

M. O. Rabin, Decidaiblity of Second-Order Theories and Automata on Infinite Trees, In: Transaction of the American Mathematical Society, vol.141, pp.1-35, 1969.

M. O. Rabin, Automata on infinite objects and Church's problem, 1972.
DOI : 10.1090/cbms/013

D. Radzinski, Chinese number-names, tree adjoining languages, and mild context-sensitivity, In: Comput. Linguist, vol.17, pp.277-299, 1991.

O. Rambow and G. Satta, A rewritting system for free word order syntax that is non-local and mildly context sensitive " . In: Current Issues in Mathematical Linguistics, Martín-Vide, vol.56, 1994.

O. Rambow and G. Satta, A Two-Dimensional Hierarchy for Parallel Rewriting Systems, 1994.

O. Rambow and G. Satta, Independent parallelism in finite copying parallel rewriting systems, Theoretical Computer Science, vol.223, issue.1-2, pp.87-120, 1999.
DOI : 10.1016/S0304-3975(97)00190-4

A. Ranta, Type-theoretical Grammar, Indices. Oxford Science Publisher, vol.1, 1994.

H. G. Rice, Classes of recursively enumerable sets and their decision problems, Transactions of the American Mathematical Society, vol.74, issue.2, pp.358-366, 1953.
DOI : 10.1090/S0002-9947-1953-0053041-6

J. Rogers, A Descriptive Approach to Language-Theoretic Complexity. Studies in Logic, Language & Information, CSLI publications, 1998.

J. Rogers, A model-theoretic framework for theories of syntax, Proceedings of the 34th annual meeting on Association for Computational Linguistics -, pp.24-27, 1996.
DOI : 10.3115/981863.981865

J. Rogers, wMSO theories as grammar formalisms, Theoretical Computer Science, vol.293, issue.2, pp.291-320, 2003.
DOI : 10.1016/S0304-3975(01)00349-8

J. Rogers, Wrapping of trees, Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics , ACL '04, pp.558-565, 2004.
DOI : 10.3115/1218955.1219026

B. Rozoy, The Dyck language D'1??? is not generated by any matrix grammar of finite index, Information and Computation, vol.74, issue.1, pp.64-89, 1987.
DOI : 10.1016/0890-5401(87)90012-5

Y. Schabes and A. K. Joshi, An Earley-type parsing algorithm for Tree Adjoining Grammars, Proceedings of the 26th annual meeting on Association for Computational Linguistics -, pp.258-269, 1988.
DOI : 10.3115/982023.982055

M. Schmidt-schauu, Decidability of Behavioural Equivalence in Unary PCF, In: Theor. Comput. Sci, vol.2161, issue.2, pp.363-373, 1999.

S. Schmitz, On the Computational Complexity of Dominance Links in Grammatical Formalisms, Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00482396

H. Schwichtenberg, Definierbare Funktionen im??-Kalk??l mit Typen, Archiv f??r Mathematische Logik und Grundlagenforschung, vol.17, issue.3-4, pp.113-114, 1976.
DOI : 10.1007/BF02276799

D. Scott, Continuous lattices, Ed. by F. Lawvere. Lecture Notes in Mathematics, vol.274
DOI : 10.1007/BFb0073967

H. Seki, T. Matsumura, M. Fujii, and T. Kasami, On multiple context-free grammars, Theoretical Computer Science, vol.88, issue.2, pp.191-229, 1991.
DOI : 10.1016/0304-3975(91)90374-B

G. Sénizergues, L(A)=L(B)? decidability results from complete formal systems, Theoretical Computer Science, vol.251, issue.1-2, pp.1-2, 2001.
DOI : 10.1016/S0304-3975(00)00285-1

S. M. Shieber, Evidence Against the Context-Freeness of Natural Language Reprinted in The Formal Complexity of Natural Language, Linguistics and Philosophy Philosophy, Language, and Artificial Intelligence, vol.8, pp.320-334, 1985.

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

]. A. Sorokin, Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars, Developments in Language Theory -18th International Conference Proceedings, pp.154-165, 2014.
DOI : 10.1007/978-3-319-09698-8_14

E. H. Spanier, Algebraic Topology. Corrected reprint, 1981.

E. P. Stabler, Derivational minimalism, Logical Aspects of Computational Linguistics, First International Conference, LACL '96, pp.68-95, 1996.
DOI : 10.1007/BFb0052152

E. P. Stabler, Varieties of crossing dependencies: structure dependence and mild context sensitivity, Cognitive Science, vol.25, issue.2, pp.699-720, 2004.
DOI : 10.1207/s15516709cog2805_4

R. Statman, Completeness, invariance and ??-definability, The Journal of Symbolic Logic, vol.344, issue.01, pp.17-26, 1982.
DOI : 10.1016/0304-3975(76)90021-9

R. Statman and G. Dowek, On Statman's finite completeness theorem, 1992.

R. Statman, On the In: Annals of Pure and Applied Logic 130, Papers presented at the 2002 IEEE Symposium on Logic in Computer Science (LICS), pp.1-3, 2004.

P. Staudacher, New frontiers beyond context-freeness, Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics -, pp.358-367, 1993.
DOI : 10.3115/976744.976786

C. Stirling, A Game-Theoretic Approach to Deciding Higher-Order Matching, Lecture Notes in Computer Science, vol.4052, issue.2, pp.348-359, 2006.
DOI : 10.1007/11787006_30

C. Stirling, Decidability of higher-order matching, Logical Methods in Computer Science, vol.5, issue.3, 2009.
DOI : 10.2168/LMCS-5(3:2)2009

W. W. Tait, Intensional interpretations of functionals of finite type I, The Journal of Symbolic Logic 32, pp.198-212, 1967.
DOI : 10.1007/BF01447860

T. Terao and N. Kobayashi, A ZDD-Based Efficient Higher-Order Model Checking Algorithm, APLAS 2014, pp.354-371, 2014.
DOI : 10.1007/978-3-319-12736-1_19

J. W. Thatcher and J. B. Wright, Generalized finite automata, In: Notices Amer. Math. Soc, 1965.

J. Thatcher and J. W. English, Generalized finite automata theory with an application to a decision problem of second-order logic, Mathematical systems theory 34, pp.57-81, 1968.
DOI : 10.1007/BF01691346

B. A. Trakhtenbrot, Finite automata and monadic second order logic, In: Siberian Math. J, vol.3, pp.101-131, 1962.

P. Urzyczyn, The Emptiness Problem for Intersection Types, In: J. Symb. Log, vol.643, pp.1195-1215, 1999.

K. N. Verma and J. Goubault-larrecq, Karp-Miller Trees for a Branching Extension of VASS, In: Discrete Mathematics & Theoretical Computer Science, vol.7, issue.1, pp.217-230, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00959038

K. Vijay-shanker, D. J. Weir, and A. K. Joshi, Characterizing structural descriptions produced by various grammatical formalisms, Proceedings of the 25th annual meeting on Association for Computational Linguistics -, pp.104-111, 1987.
DOI : 10.3115/981175.981190

I. Walukiewicz, Monadic second-order logic on tree-like structures, In: Theor. Comput. Sci, vol.2751, issue.2, pp.311-346, 2002.

M. Wand, A Concrete Approach to Abstract Recursion Definitions, pp.331-341, 1972.

M. Wand, Final algebra semantics and data type extensions, Journal of Computer and System Sciences, vol.19, issue.1, pp.27-44, 1979.
DOI : 10.1016/0022-0000(79)90011-4

D. J. Weir, A geometric hierarchy beyond context-free languages, Theoretical Computer Science, vol.104, issue.2, pp.235-261, 1992.
DOI : 10.1016/0304-3975(92)90124-X

D. J. Weir, Linear context-free rewriting systems and deterministic tree-walking transducers, Proceedings of the 30th annual meeting on Association for Computational Linguistics -, pp.136-143, 1992.
DOI : 10.3115/981967.981985

T. Wilke, An Eilenberg Theorem for Infinity-Languages, pp.91-588, 1991.

E. S. Bar-hillel and M. Perles, On formal properties of simple phrase structure grammars, Zeitschrift für Phonetik Sprachwissenschaft, p.14, 1961.

D. Younger, Recognition and parsing of context-free languages in time n3, Information and Control, vol.10, issue.2, pp.572-597, 1967.
DOI : 10.1016/S0019-9958(67)80007-X

W. Zielonka, ]. A. Ball, P. Bourreau, É. Kien, and S. Salvati, Infinite games on finitely coloured graphs with applications to automata on infinite trees, Theoretical Computer Science 200 Building PMCFG Parsers as Datalog Program Transformations " . In: the 8th International Conference on Logical Aspects of Computational Linguistics, pp.135-183, 1998.
DOI : 10.1016/S0304-3975(98)00009-7

P. Bourreau and S. Salvati, A Datalog Recognizer for Almost Affine ??-CFGs, Lecture Notes in Computer Science, vol.19, issue.2, pp.21-38, 2011.
DOI : 10.1007/s10849-009-9110-0
URL : https://hal.archives-ouvertes.fr/hal-00740701

P. Bourreau and S. Salvati, Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed lambda-Calculus, 10th International Conference on Typed Lambda Calculi and Applications, pp.61-75, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00719044

L. Clément, J. Kirman, and S. Salvati, A logical approach to grammar description, Journal of Language Modelling, vol.3, issue.1, 2015.
DOI : 10.15398/jlm.v3i1.94

B. [. De-groote, S. Guillaume, and . Salvati, Vector addition tree automata, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., pp.19-63, 2004.
DOI : 10.1109/LICS.2004.1319601

M. Kanazawa, G. M. Kobele, J. Michaelis, S. Salvati, and R. Yoshinaka, The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages, Theory of Computing Systems, vol.104, issue.2, pp.250-278, 2014.
DOI : 10.1007/s00224-014-9534-z
URL : https://hal.archives-ouvertes.fr/hal-01251232

M. Kanazawa and S. Salvati, Generating control languages with Abstract Categorial Grammars, Proceedings of the 12th conference on Formal Grammar, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00306222

M. Kanazawa and S. Salvati, MIX is not a tree-adjoining language, Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics, pp.666-674, 2012.

M. Kanazawa and S. Salvati, The Copying Power of Well-Nested Multiple Context-Free Grammars, 4th International Conference on Language and Automata Theory and Applications, pp.344-355, 2010.
DOI : 10.1007/978-3-642-13089-2_29

M. Kanazawa and S. Salvati, The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars, 18th conference on Formal Grammar, pp.191-208, 2013.
DOI : 10.1007/978-3-642-39998-5_12
URL : https://hal.archives-ouvertes.fr/hal-00945526

J. Kirman and S. Salvati, On the Complexity of Free Word Orders, 18th conference on Formal Grammar, pp.209-224, 2013.
DOI : 10.1007/978-3-642-39998-5_13
URL : https://hal.archives-ouvertes.fr/hal-00945516

S. [. Kobele and . Salvati, The IO and OI hierarchies revisited, Information and Computation, vol.243, pp.205-221, 2015.
DOI : 10.1016/j.ic.2014.12.015
URL : https://hal.archives-ouvertes.fr/hal-01251097

S. [. Retoré and . Salvati, A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars, Journal of Logic, Language and Information, vol.55, issue.3???4, pp.185-200, 2010.
DOI : 10.1007/s10849-009-9111-z

S. Salvati and I. Walukiewicz, Krivine Machines and Higher-Order Schemes, LNCS, vol.6756, issue.2, pp.162-173, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01121744

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

I. [. Salvati and . Walukiewicz, Using models to model-check recursive schemes, In: Logical Methods In Computer Science, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00741077

. [. Salvati, Encoding second order string ACG with Deterministic Tree Walking Transducers, Proceedings FG 2006: the 11th conference on Formal Grammars. Ed. by S. Wintner. FG Online Proceedings. CSLI Publications, pp.143-156, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00333886

. [. Salvati, Minimalist Grammars in the Light of Logic Logic and grammar -Essays Dedicated to Alain Lecomte on the Occasion of His 60th Birthday, LNCS/LNAI, vol.6700, pp.81-117, 2011.

. [. Salvati, MIX is a 2-MCFL and the word problem in is captured by the IO and the OI hierarchies, Journal of Computer and System Sciences, vol.817, pp.1252-1277, 2015.

. [. Salvati, Non-linear Second Order Abstract Categorial Grammars and Deletion " . In: NLCS'15. Third Workshop on Natural Language and Computer Science, EasyChair Proceedings in Computing. EasyChair, pp.64-72, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01251127

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

. [. Salvati, Problèmes de filtrage et problèmes d'analyse pour les grammaires catégorielles abstraites, 2005.

. [. Salvati, Recognizability in the Simply Typed Lambda-Calculus, 16th Workshop on Logic, Language, Information and Computation, pp.48-60, 2009.
DOI : 10.1016/0095-8956(86)90030-4
URL : https://hal.archives-ouvertes.fr/inria-00412654

. [. Salvati, Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear ??-Calculus, proceedings of the 17th International Conference on Rewriting Techniques and Applications, pp.151-165, 2006.
DOI : 10.1007/11805618_12
URL : https://hal.archives-ouvertes.fr/inria-00334006

G. [. Salvati, M. Manzonetto, H. Gehrke, and . Barendregt, Loader and Urzyczyn Are Logically Related, 39th International Colloquium on Automata, Languages and Programming (ICALP (2) 2012). Lecture Notes in Computer Science, pp.364-376, 2012.
DOI : 10.1007/978-3-642-31585-5_34
URL : https://hal.archives-ouvertes.fr/hal-00959623

I. [. Salvati and . Walukiewicz, A Model for Behavioural Properties of Higher-order Programs " . In: 24th EACSL Annual Conference on Computer Science Logic (CSL 2015), Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl?Leibniz-Zentrum fuer Informatik, pp.229-243, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01145494

I. [. Salvati and . Walukiewicz, Evaluation is MSOL-compatible, 33rd International Conference on Foundations of Software Technology and Theoretical Computer Science LIPIcs. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00773126

S. Salvati and I. Walukiewicz, Krivine Machines and Higher-Order Schemes, 38th International Colloquium on Automata, Languages and Programming, pp.162-173, 2011.
DOI : 10.1007/s10990-007-9019-8
URL : https://hal.archives-ouvertes.fr/hal-01121744

I. [. Salvati and . Walukiewicz, Krivine machines and higher-order schemes, Information and Computation, vol.239, pp.340-355, 2014.
DOI : 10.1016/j.ic.2014.07.012
URL : https://hal.archives-ouvertes.fr/hal-01121744

I. [. Salvati and . Walukiewicz, Simply typed fixpoint calculus and collapsible pushdown automata, Mathematical Structures in Computer Science, vol.15, issue.07, pp.1-47, 2015.
DOI : 10.1007/978-3-642-22012-8_12
URL : https://hal.archives-ouvertes.fr/hal-01394828

I. [. Salvati and . Walukiewicz, Using Models to Model-Check Recursive Schemes, 11th International Conference on Typed Lambda Calculi and Applications, pp.189-204, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00741077