A. Abeillé, French and English determiners: Interaction of morphology, syntax and semantics in Lexicalized Tree Adjoining Grammars, Proceedings of the First International Workshop on Tree Adjoining Grammar and Related Frameworks (TAG+1) Internationales Begegnungs-und Forschungszentrum für Informatik (IBFI), Schloß Dagstuhl, pp.17-20, 1990.

A. Abeillé, The Flexibility of French Idioms: A Representation with Lexicalised Tree Adjoining Grammar, Idioms, chapter 1, pp.15-42, 1995.

A. Abeillé and Y. Schabes, Parsing idioms in lexicalized TAGs, Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics -, pp.1-9, 1989.
DOI : 10.3115/976815.976816

H. P. Barendregt, The lambda calculus, of Studies in Logic and the Foundations of Mathematics, 1984.

C. Barker, Cosubstitution, derivational locality, and quantifier scope, Proceedings of the Tenth International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+10), pp.135-142, 2010.

K. Bimbó, The decidability of the intensional fragment of classical linear logic, Theoretical Computer Science, vol.597, pp.1-17, 2015.
DOI : 10.1016/j.tcs.2015.06.019

C. Blom, P. De-groote, Y. Winter, and J. Zwarts, Implicit Arguments: Event Modification or Option Type Categories?, Logic, Language and Meaning, pp.240-250, 2012.
DOI : 10.1007/978-3-642-31482-7_25

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

J. Bos, Predicate Logic Unplugged, Proceedings of the Tenth Amsterdam Colloquium, 1995.

P. Bourreau, Jeux de Typage et Analyse de ?-Grammaires Non-Contextuelles, p.733964, 2012.
URL : https://hal.archives-ouvertes.fr/tel-00733964

P. Bourreau, Traitements d'ellipses : deux approches par les grammaires catégorielles abstraites, Actes de la 20e conférence sur le Traitement Automatique des Langues Naturelles, pp.215-228, 2013.

P. Bourreau and S. Salvati, A Datalog Recognizer for Almost Affine ??-CFGs, The Mathematics of Language, pp.21-38978, 2011.
DOI : 10.1007/s10849-009-9110-0

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

M. Candito, A principle-based hierarchical representation of LTAGs, Proceedings of the 16th conference on Computational linguistics -, pp.194-199, 1996.
DOI : 10.3115/992628.992664

M. Candito, Représentation modulaire et paramétrable de grammaires électroniques lexicalisées : application au français et à l'italien, 1999.

M. Candito and S. Kahane, Can the TAG Derivation Tree Represent a Semantic Graph? An Answer in the Light of Meaning-Text Theory, Proceedings of the Fourth International Workshop on Tree Adjoining Grammars and Related Framework (TAG+4), volume 98-12 of IRCS Technical Report Series, pp.98-0106, 1998.

B. Carpenter, Type-Logical Semantics, 1997.

J. Chen, S. Bangalore, and K. Vijay-shanker, Automated extraction of Tree-Adjoining Grammars from treebanks, Natural Language Engineering, vol.12, issue.03, pp.251-299, 2006.
DOI : 10.1017/S1351324905003943

B. Crabbé, Grammatical Development with Xmg, Logical Aspects of Computational Linguistics: 5th International Conference, LACL 2005. Proceedings, pp.84-100, 1007.
DOI : 10.1007/11422532_6

H. Brooks and C. , Some Logical Aspects of Grammatical Structure, Structure of Language and its Mathematical Aspects: Proceedings of the Twelfth Symposium in Applied Mathematics, pp.56-68, 1961.

L. Danlos and T. A. , D-STAG : un formalisme d'analyse automatique de discours basé sur les TAG synchrones, pp.111-143, 2009.

L. Danlos, D-STAG: A Formalism for Discourse Analysis Based on SDRT and Using Synchronous TAG, 14th conference on Formal Grammar -FG 2009, pp.64-84, 2011.
DOI : 10.1162/089120103322753347

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

L. Danlos, A. Maskharashvili, and S. Pogodalla, Grammaires phrastiques et discursives fondées sur les TAG : une approche de D-STAG avec les ACG, TALN 2015 -22e conférence sur le Traitement Automatique des Langues Naturelles, pp.158-169, 2015.

L. Danlos, A. Maskharashvili, and S. Pogodalla, Interfacing Sentential and Discourse TAG-based Grammars, in The 12th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+12, Proceedings of the 12th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+12), pp.1328697-1328713, 2016.

D. Davidson, Essays on Actions and Events, volume 1 of Philosophical Essays of Donald Davidson, 2001.

P. De and G. , Towards Abstract Categorial Grammars, Association for Computational Linguistics, 39th Annual Meeting and 10th Conference of the European Chapter Proceedings of the Conference, pp.148-155, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00100529

P. De and G. , Tree-Adjoining Grammars as Abstract Categorial Grammars, pp.145-150, 2002.

P. De and G. , Towards a Montagovian account of dynamics, Proceedings of Semantics and Linguistic Theory (SALT) 16, 2006.

P. De and G. , Abstract Categorial Parsing as Linear Logic Programming, Proceedings of the 14th Meeting on the Mathematics of Language, pp.15-25, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01188632

P. De, G. , and M. Kanazawa, A Note on Intensionalization, Journal of Logic, Language and Information, vol.22, issue.2, pp.173-194, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00909207

P. De, G. , and S. Maarek, Type-theoretic extensions of Abstract Categorial Grammars, in New Directions in Type-Theoretic Grammars, proceedings of the workshop, pp.18-30, 2007.

P. De, G. , and S. Pogodalla, On the expressive power of Abstract Categorial Grammars: Representing context-free formalisms, Journal of Logic, Language and Information, vol.13, issue.4, pp.421-438, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00112956

P. De-groote, R. Yoshinaka, and S. Maarek, On Two Extensions of Abstract Categorial Grammars, Nachum Dershowitz and, 2007.
DOI : 10.1007/978-3-540-75560-9_21

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

É. Villemonte-de and L. Clergerie, From metagrammars to factorized TAG/TIG parsers, Proceedings of the Ninth International Workshop on Parsing Technology, pp.190-191, 2005.

M. Dymetman, Inherently Reversible Grammars, Reversible Grammars in Natural Language Processing, pp.33-57, 1994.
DOI : 10.1007/978-1-4615-2722-0_2

M. Egg, A. Koller, and J. Niehren, The Constraint Language for Lambda Structures, Journal of Logic, Language and Information, vol.10, issue.4, pp.457-4851017964622902, 1023.
DOI : 10.1023/A:1017964622902

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

K. Forbes, E. Miltsakaki, R. Prasad, A. Sarkar, A. K. Joshi et al., D-LTAG System: Discourse Parsing with a Lexicalized Tree-Adjoining Grammar, Discourse and Information Structure, pp.261-2791024137719751, 2003.
DOI : 10.1023/A:1024137719751

K. Forbes-riley, B. L. Webber, and A. K. Joshi, Computing Discourse Semantics: The Predicate-Argument Semantics of Discourse Connectives in D-LTAG, Journal of Semantics, vol.23, issue.1, pp.55-106, 2006.
DOI : 10.1093/jos/ffh032

C. Gardent, Integrating a unification-based semantics in a large scale Lexicalised Tree Adjoininig Grammar for French, Proceedings of the 22nd International Conference on Computational Linguistics, pp.249-256, 2008.

C. Gardent and L. Kallmeyer, Semantic construction in feature-based TAG, Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics , EACL '03, pp.123-130, 2003.
DOI : 10.3115/1067807.1067825

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

C. Gardent and Y. Parmentier, Large Scale Semantic Construction for Tree Adjoining Grammars, Logical Aspects of Computational Linguistics, pp.131-146, 2005.
DOI : 10.1007/11422532_9

J. Groenendijk and M. Stokhof, Dynamic predicate logic, Linguistics and Philosophy, vol.12, issue.1, pp.39-100, 1991.
DOI : 10.1007/BF00628304

URL : ftp://moon.philo.uva.nl/pub/stokhof/papers/dpl.pdf

M. Huot, Conservative extensions of Montague semantics, Master's thesis, ENS Cachan, 2017.

R. Jackendoff, Pr??cis of Foundations of Language: Brain, Meaning, Grammar, Evolution,, Behavioral and Brain Sciences, vol.26, issue.06, 2002.
DOI : 10.1017/S0140525X03000153

K. Aravind and . Joshi, Tree-adjoining grammars: How much context sensitivity is required to provide reasonable structural descriptions?, Natural Language Parsing, pp.206-250, 1985.

K. Aravind, L. Joshi, M. Kallmeyer, and . Romero, Flexible Composition in LTAG: Quantifier Scope and Inverse Linking, Harry Bunt, Ielka van der Sluis, and Roser Morante Proceedings of the Fifth International Workshop on Computational Semantics IWCS-5, 2003.

K. Aravind, L. S. Joshi, M. Levy, and . Takahashi, Tree Adjunct Grammars, Journal of Computer and System Sciences, vol.10, issue.175, pp.136-163, 1975.

K. Aravind, Y. Joshi, and . Schabes, Tree-adjoining grammars, Handbook of formal languages, 1997.

L. Kallmeyer, Using an Enriched TAG Derivation Structure as Basis for Semantics, pp.127-136, 2002.

L. Kallmeyer, Parsing Beyond Context-Free Grammars, Cognitive Technologies, pp.978-981, 1007.
DOI : 10.1007/978-3-642-14846-0

URL : https://link.springer.com/content/pdf/bfm%3A978-3-642-14846-0%2F1.pdf

L. Kallmeyer and A. K. Joshi, Factoring Predicate Argument and Scope Semantics: Underspecified Semantics with LTAG, Research on Language and Computation, vol.1, issue.1/2, pp.3-581024564228892, 1023.
DOI : 10.1023/A:1024564228892

L. Kallmeyer and M. Kuhlmann, A Formal Model for Plausible Dependencies in Lexicalized Tree Adjoining Grammar, pp.108-116, 2012.

L. Kallmeyer and M. Romero, LTAG Semantics with Semantic Unification, Seventh International Workshop on Tree Adjoining Grammar and Related Formalisms - TAG+7, pp.155-162, 2004.

L. Kallmeyer and M. Romero, Scope and Situation Binding in LTAG Using Semantic Unification, Research on Language and Computation, vol.10, issue.4, pp.3-52, 1007.
DOI : 10.1075/z.35.09kro

M. Kanazawa, Parsing and Generation as Datalog Queries, Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics (ACL), pp.176-183, 2007.

M. Kanazawa, Prefix-correct Earley parsing of mildly context-sensitive languages, Invited talk at the 15th Workshop on Logic, Language, Information and Computation, 2008.

M. Kanazawa, A prefix-correct Earley recognizer for multiple context-free grammars, Proceedings of the Ninth International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+9), pp.49-56, 2008.

M. Kanazawa, Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars, Journal of Logic, Language and Information, vol.88, issue.2, pp.137-161, 2009.
DOI : 10.1007/978-3-642-59126-6_1

URL : http://research.nii.ac.jp/~kanazawa/publications/soacgahrg.pdf

M. Kanazawa, Parsing and Generation as Datalog Query Evaluation, IfCoLog Journal of Logics and their Applications, pp.1103-1211, 2017.

M. Kanazawa and S. Salvati, Generating Control Languages with Abstract Categorial Grammars Proceedings of The 12th conference on Formal Grammar FG, 2007.

R. Kasper, B. Kiefer, K. Netter, and K. Vijay-shanker, Compilation of HPSG to TAG, Proceedings of the 33rd annual meeting on Association for Computational Linguistics -, pp.92-99, 1995.
DOI : 10.3115/981658.981671

M. Gregory and . Kobele, Idioms and Extended Transducers, pp.153-161, 2012.

M. Gregory, J. Kobele, and . Michaelis, CoTAGs and ACGs, Logical Aspects of Computational Linguistics, pp.119-134978, 2012.

A. Koller and M. Kuhlmann, A Generalized View on Parsing and Translation, Proceedings of the 12th International Conference on Parsing Technologies, pp.2-13, 2011.

A. Koller and M. Kuhlmann, Decomposing TAG Parsing Algorithms Using Simple Algebraizations, pp.135-143, 2012.

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

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

S. Martin and C. Pollard, A Dynamic Categorial Grammar, Lecture Notes in Computer Science, vol.8612, issue.76, pp.138-154978, 2014.
DOI : 10.1007/978-3-662-44121-3_9

URL : http://www.ling.ohio-state.edu//~scott/publications/Martin-Pollard-FG-2014.pdf

A. Maskharashvili and S. Pogodalla, Constituency and Dependency Relationship from a Tree Adjoining Grammar and Abstract Categorial Grammar Perspective The Asian Federation of Natural Language Processing, 6th International Joint Conference on Natural Language Processing, pp.1257-1263, 2013.

R. Montague, The Proper Treatment of Quantification in Ordinary English, Approaches to Natural Language: Proceedings of the, 1970.

R. N. Nesson, Synchronous and Multicomponent Tree-Adjoining Grammars: Complexity, Algorithms, and Applications, 2009.

S. Pogodalla, Computing Semantic Representation: Towards ACG Abstract Terms as Derivation Trees, in Seventh International Workshop on Tree Adjoining Grammar and Related Formalisms -TAG+7 open archive: inria-00107768, pp.64-71, 2004.

S. Pogodalla, Using and Extending the ACG technology: Endowing Categorial Grammars with an Underspecified Semantic Representation, in Categorial Grammars, pp.197-209, 2004.

S. Pogodalla, Ambiguïté de portée et approche fonctionnelle des TAG, in Traitement Automatique des Langues Naturelles -TALN, pp.325-334, 2007.

S. Pogodalla, Generalizing a Proof-Theoretic Account of Scope Ambiguity, 7th International Workshop on Computational Semantics -IWCS-7, p.112898, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00112898

S. Pogodalla, Advances in Abstract Categorial Grammars: Language Theory and Linguistic Modeling. ESSLLI, Lecture Notes, Part II, p.749297, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00749297

F. Pompigne, Logical modelization of language and Abstract Categorial Grammars, Theses, p.921040, 2013.

O. Rambow, K. Vijay-shanker, and D. Weir, D-tree grammars, Proceedings of the 33rd annual meeting on Association for Computational Linguistics -, pp.151-158, 1995.
DOI : 10.3115/981658.981679

O. Rambow, K. Vijay-shanker, and D. Weir, D-Tree Substitution Grammars, Computational Linguistics, vol.18, issue.4, pp.87-121, 2001.
DOI : 10.1007/BF01048403

J. Rogers, Generalized Tree-Adjoining Grammar, Sixth Meeting on Mathematics of Language, 1999.

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

S. Salvati, Encoding second order string ACG with Deterministic Tree Walking Transducers Proceedings of The 11th conference on Formal Grammar FG, FG Online Proceedings, pp.143-156, 2006.

S. Salvati, A Note on the Complexity of Abstract Categorial Grammars, Proceedings of the 10th Conference on Mathematics of Language, 2007.
DOI : 10.1007/978-3-642-14322-9_20

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

Y. Schabes and S. M. Shieber, An alternative conception of tree-adjoining derivation, Proceedings of the 30th annual meeting on Association for Computational Linguistics -, pp.91-124, 1994.
DOI : 10.3115/981967.981989

M. Stuart and . Shieber, A Uniform Architecture for Parsing and Generation, Proceedings of the 12th International Conference on Computational Linguistics, pp.614-619, 1988.

M. Stuart and . Shieber, The Problem of Logical-Form Equivalence, Computational Linguistics, vol.19, issue.1, pp.179-190, 1993.

M. Stuart and . Shieber, Restricting the Weak-Generative Capacity of Synchronous Tree-Adjoining Grammars, Computational Intelligence, vol.10, issue.4, pp.371-385, 1994.

M. Stuart and . Shieber, Synchronous Grammars as Tree Transducers, Proceedings of the 7th International Workshop on Tree Adjoining Grammar and Related Formalisms, pp.88-95, 2004.

M. Stuart and . Shieber, Unifying Synchronous Tree-Adjoining Grammars and Tree Transducers via Bimorphisms, Proceedings of the 11th Conference of the European Chapter of the Association for Computational Linguistics (EACL-06), pp.377-384, 2006.

M. Stuart and . Shieber, Bimorphisms and synchronous grammars, Journal of Language Modelling, vol.2, issue.1, pp.51-104, 2014.

M. Stuart, Y. Shieber, and . Schabes, Synchronous Tree-Adjoining Grammars, Proceedings of the 13th International Conference on Computational Linguistics, pp.253-258, 1990.

M. Stuart, . Shieber, R. C. Gertjan-van-noord, F. C. Moore, and . Pereira, A Semantic-Head-Driven Generation Algorithm for Unification-Based Formalisms, Proceedings of the 27th Annual Meeting of the Association for Computational Linguistics, pp.7-17, 1989.

M. Steedman, The Syntactic Process, 2001.

M. Steedman and J. Baldridge, Combinatory Categorial Grammar Non-Transformational Syntax: Formal and Explicit Models of Grammar, 2011.

K. Vijay-shanker, A Study of Tree Adjoining Grammars, 1987.

K. Vijay-shanker, Using Descriptions of Trees in a Tree Adjoining Grammar, Computational Linguistics, vol.18, issue.4, pp.481-518, 1992.

K. Vijay-shanker and A. K. Joshi, Some Computational Properties of Tree Adjoining Grammars, Proceedings of the 23rd Annual Meeting of the Association for Computational Linguistics, pp.82-93, 1985.

K. Vijay-shanker and A. K. Joshi, Feature structures based Tree Adjoining Grammars, Proceedings of the 12th conference on Computational linguistics -, pp.714-718, 1988.
DOI : 10.3115/991719.991783

K. Vijay-shanker and A. K. Joshi, Unification-Based Tree Adjoining Grammars, 1991.

B. L. Webber, D-LTAG: extending lexicalized TAG to discourse, Cognitive Science, vol.29, issue.4, pp.751-779, 2004.
DOI : 10.1162/089120103322753347

B. L. Webber and A. K. Joshi, Anchoring a Lexicalized Tree-Adjoining Grammar for Discourse, Proccedings of the ACL/COLING workshop on Discourse Relations and Discourse Markers, pp.98-0315, 1998.

D. J. Weir, Characterizing Mildly Context-Sensitive Grammar Formalisms, 1988.

S. Michael and W. , Application of Synchronous Tree-Adjoining Grammar to Quantifier Scoping in English, Bachelor's thesis, Harvard College, 1993.

F. Xia, Automatic Grammar Generation from Two Different Perspectives, 2001.

F. Xia, C. Han, M. Palmer, and A. Joshi, Comparing Lexicalized Treebank Grammars extracted from Chinese, Korean, and English corpora, Proceedings of the second workshop on Chinese language processing held in conjunction with the 38th Annual Meeting of the Association for Computational Linguistics -, pp.52-59, 2000.
DOI : 10.3115/1117769.1117778

URL : http://acl.ldc.upenn.edu/W/W00/W00-1208.pdf

F. Xia, M. Palmer, and K. Vijay-shanker, AUTOMATICALLY GENERATING TREE ADJOINING GRAMMARS FROM ABSTRACT SPECIFICATIONS, Computational Intelligence, vol.18, issue.4, pp.246-285, 2005.
DOI : 10.1017/CBO9780511597855.007

URL : http://www.eecis.udel.edu/%7Evijay/papers/fei-ci.pdf

G. Xtag-research, A Lexicalized Tree Adjoining Grammar for English, 2001.

R. Yoshinaka, Linearization of Affine Abstract Categorial Grammars, in proceedings of Fromal Grammar, 2006.

R. Yoshinaka and M. Kanazawa, The Complexity and Generative Capacity of Lexicalized Abstract Categorial Grammars, Proceedings of Logical Aspects of Computational Linguistics: 5th International Conference, LACL 2005, pp.330-348, 1007.
DOI : 10.1007/11422532_22