A. Abeillé, N. Barrierabr96, and ]. V. Abrusci, Enriching a french treebank Lambek calculus, cyclic multiplicative-additive linear logic, noncommutative multiplicative-additive linear logic : language and sequent calculus, Proceedings of Language Ressources and Evaluation Conference Proceedings of 1996 Roma Workshop on Proofs and Linguistic Categoriss, pp.138-159, 1996.

A. Abeillé, L. Clément, and F. Toussenel, Building a Treebank for French Building and Using Parsed Corpora, chapter 10 Non-commutative logic i : the multiplicative fragment, Annals of pure and applied logic, pp.13827-1329, 1935.

P. Blackburn and J. Bos, Computational semantics, Theoria, vol.18, issue.1, pp.27-45, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099715

P. Blackburn and J. Bos, Representation and inference for natural language : A first course in computational semantics. CSLI, BBH11] Martin Berglund, Henrik Björklund, and Johanna Högberg. Recognizing shuffled languages. Language and Automata Theory and Applications, pp.126-142, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00001208

P. Bedaride, Implication Textuelle et Réécriture, p.171, 2010.

E. M. Bender, D. Flickinger, S. Oepen, and Y. Zhang, Parser evaluation over local and non-local deep dependencies in a large corpus, Proceedings of 194

O. Bonami-anddanì-ele and . Godard, Lexical semantics and pragmatics of evaluative adverbs, Adjectives and Adverbs : Syntax, Semantics, and Discourse, pp.274-304, 2008.

P. Bédaride, C. Blackburn, B. Gaiffe, and M. Marx, Semantic normalisation, Proceedings of the Eighth International Conference on Computational Semantics, IWCS-8 '09, pp.146-156, 2003.
DOI : 10.3115/1693756.1693805

G. Bonfante, B. Guillaume, and G. Perrier, Analyse syntaxiqué electostatique, ´ Evolutions en analyse syntaxique, p.37, 2003.

G. Bonfante, B. Guillaume, and G. Perrier, Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation A quasi-arithmetical notation for syntactic description, Proceedings of CoLing, pp.11947-58, 1953.

A. Böhmová, J. Haji?, E. Haji?ová, and B. Hladká, The Prague Dependency Treebank : A Three-Level Annotation Scenario, pp.103-127, 2003.

S. Bangalore, A. K. Joshi, S. Bangalore, and A. K. Joshi, Supertagging : An approach to almost parsing Computational linguistics Supertagging : Using Complex Lexical Descriptions in Natural Language Processing, Handbook of Natural Language Processing, pp.237-265, 0192.

P. Blache, Property Grammars: A Fully Constraint-Based Theory, Constraint Solving and Language Processing, pp.119-142, 2005.
DOI : 10.1007/11424574_1

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

P. Blache, Pour une représentation décentralisée de l'information syntaxique, p.25, 2007.

G. Bonfante, J. L. Roux, and G. Perrier, Lexical Disambiguation with Polarities and Automata, Procedings of 11th International Conference on Implementation and Application of Automata, pp.72-74, 2006.
DOI : 10.1007/11812128_30

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

F. Baader and T. Nipkow, Term rewriting and all that, p.146, 1999.

J. Bos, Underspecification and Resolution in Discourse Semantics

P. Boullier, Proposal for a natural language processing syntactic backbone, p.48, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00073347

P. Boullier, Guided earley parsing, Proceedings of the 8th International Workshop on Parsing Technologies (IWPT 03), pp.43-54, 2003.

P. Boullier, A nonstatistical parsing-based approach to supertagging, Supertagging : Using Complex Lexical Descriptions in Natural Language Processing, pp.173-191, 2010.

H. Bunt, Semantic underspecification : Which technique for what purpose ? Computing Meaning, pp.55-85, 2007.

[. Buszkowski, Lambek grammars based on pregroups. Logical aspects of computational linguistics, pp.95-109, 2001.
DOI : 10.1007/3-540-48199-0_6

B. Bohnet and L. Wanner, On using a parallel graph rewriting formalism in generation, Proceedings of the 8th European workshop on Natural Language Generation , EWNLG '01, pp.1-11, 2001.
DOI : 10.3115/1117840.1117847

C. Mariehéì-ene, A principle-based hierarchical representation of ltags, Proceedings of the 16th conference on ComputationalCar08] Olivier Carton. Langages formels, calculabilité et complexité. Vuibert, pp.194-199, 1996.

J. Carroll, T. Briscoe, and A. Sanfilippo, Parser Evaluation, Proceedings of the 1st International Conference on Language Resources and Evaluation, pp.447-454, 1998.
DOI : 10.1007/978-94-010-0201-1_17

B. Mariehéì-ene-candito, P. Crabbé, and . Denis, Statistical french dependency parsing : Treebank conversion and first results, Proceedings of LREC'2010, p.139, 2010.

B. Mariehéì-ene-candito, P. Crabbé, F. Denis, and . Guérin, Analyse syntaxique statistique du français : des constituants aux dépendances, p.183, 2009.

B. Mariehéì-ene-candito, M. Crabbé, and . Falco, Dépendances syntaxiques de surface pour le fran¸cais, p.174, 2011.

J. R. Curran, S. Clark, and D. Vadas, Multi-tagging for lexicalizedgrammar parsing, Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics, pp.697-704, 2006.

A. Copestake and D. Flickinger, An open-source grammar development environment and broad-coverage english grammar using HPSG, Conference on Language Resources and Evaluation, p.127, 2000.

A. Copestake, D. Flickinger, C. Pollard, and I. A. Sag, Minimal Recursion Semantics: An Introduction, Research on Language and Computation, vol.19, issue.1, pp.281-332, 2005.
DOI : 10.1007/s11168-006-6327-9

D. Chiang, Statistical parsing with an automatically-extracted tree adjoining grammar, Proceedings of the 38th Annual Meeting on Association for Computational Linguistics , ACL '00, pp.456-463, 2000.
DOI : 10.3115/1075218.1075276

URL : http://acl.ldc.upenn.edu/P/P00/P00-1058.pdf

[. Chomsky, Aspects of the Theory of Syntax, p.170, 1965.

C. Mariehéì-ene 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 Workshop on Tree-Adjoining Grammars and Related Frameworks, p.129, 1998.

R. Crouch and T. H. King, Semantics via f-structure rewriting Une approche paresseuse de l'analyse sémantique ou comment construire une interface syntaxe-sémantiquè a partir d'exemples, Proceedings of the LFG06 Conference Actes de TALN, pp.145-165, 2006.

J. Carroll, G. Minnen, and T. Briscoe, Parser Evaluation, Treebanks. Building and Using Parsed Corpora, pp.299-316, 2003.
DOI : 10.1007/978-94-010-0201-1_17

A. Cahill, M. Mccarthy, J. Van-genabith, and A. Way, Automatic annotation of the penn treebank with lfg f-structure information, LREC, 2002.

A. Copestake, Semantic composition with (robust) minimal recursion semantics, Proceedings of the Workshop on Deep Linguistic Processing, DeepLP '07, pp.73-80
DOI : 10.3115/1608912.1608925

A. Copestake, Slacker semantics, Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics on, EACL '09, pp.1-9, 2005.
DOI : 10.3115/1609067.1609167

D. Duchier, T. Dao, Y. Parmentier, and W. Lesaint, Semantics and syntax in Lexical Functional Grammar : The resource logic approach Une modélisation en CSP des Grammaires de Propriétés Extensible Dependency Grammar : a modular grammar formalism based on multigraph description, JFPC 2010 Sixì emes Journées Francophones de Programmation par Contraintes, pp.126-123, 1999.

P. De and G. , Towards abstract categorial grammars, Proceedings of the 39th Annual Meeting on Association for Computational Linguistics, pp.252-259
URL : https://hal.archives-ouvertes.fr/inria-00100529

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, S. Pogodalla, and C. Pollard, About Parallel and Syntactocentric Formalisms : A Perspective from the Encoding of Convergent Gram- Bibliographie mar into Abstract Categorial Grammar, Fundamenta Informaticae, vol.106, issue.2-4, pp.211-231, 2011.

D. Dlp05a, J. L. Duchier, Y. Roux, and . Parmentier, Master's thesis The metagrammar compiler : An nlp application with a multi-paradigm architecture, Multiparadigm Programming in Mozart/Oz, pp.25-175, 2005.

M. Dalrymple, J. Lamping, F. Pereira, and V. Saraswat, A deductive account of quantification in LFG, pp.33-57, 1996.

[. Ebert, Formal investigations of underspecified representations, p.126, 2005.

R. Echahed, Inductively Sequential Term-Graph Rewrite Systems, In ICGT, pp.84-98, 2008.
DOI : 10.1007/978-3-540-87405-8_7

[. Egg, A. Koller, and J. Niehren, The constraint language for lambda structures, Journal of Logic, Language and Information, vol.10, issue.4, pp.457-485, 2001.
DOI : 10.1023/A:1017964622902

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

D. Flickinger, The english resource grammar, 2007.

C. Gardent, Extraction des cadres syntaxiquesàsyntaxiquesà partir de P7dep, 2010.

G. Gazdar, Applicability of indexed grammars to natural languages. Number CSLI-85-34 in Technical Report. Center for the Study of Language and Information, p.136, 1985.

C. Gardent and C. Cerisara, Semi-Automatic Probanking for French

J. Girard, Linear logic. Theoretical computer science, pp.1-101, 1987.
URL : https://hal.archives-ouvertes.fr/inria-00075966

J. Gischer, Shuffle languages, Petri nets, and context-sensitive grammars, Communications of the ACM, vol.24, issue.9, pp.597-605, 1981.
DOI : 10.1145/358746.358767

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
DOI : 10.3115/1067807.1067825

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

[. Guillaume and G. Perrier, Interaction Grammars, Research on Language and Computation, vol.18, issue.4, pp.171-208, 2009.
DOI : 10.1007/s11168-010-9066-x

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

I. Heim and A. Kratzer, Semantics in generative grammar, p.128, 1998.

J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, HS07] Julia Hockenmaier and Mark Steedman. CCGbank : a corpus of CCG derivations and dependency structures extracted from the Penn Treebank. Computational Linguistics, pp.98355-396, 2006.

A. Richard, . Hudson, . B. Word-grammar, and . Blackwell, 11 [HY08] Julia Hockenmaier and Peter Young. Non-local scrambling : the equivalence of TAG and CCG revisited, Proceedings of TAG, p.131, 1984.

E. Hyvönen, Semantic Parsing as Graph Language Transformation -a Multidimensional Approach to Parsing Highly Inflectional Languages, In COLING, pp.517-520, 1984.

[. Valentin-jijkoun and . Maarten-de-rijke, A parallel architecture perspective on language processing Learning to transform linguistic graphs, Second Workshop on TextGraphs : Graph-Based Algorithms for Natural Language Processing, pp.2-22, 2007.

J. Jedrzejowicz, Structural properties of shuffle automata, Grammars, vol.2, issue.1, pp.35-51, 1999.
DOI : 10.1023/A:1009973609765

O. Jespersen, Analytic Syntax, p.13, 1937.

K. Aravind, Y. Joshi, and . Schabes, Tree-adjoining grammars. Handbook of Formal Languages : Beyond Words, pp.69-123, 1997.

K. Aravind, K. Joshi, and . Vijay-shanker, Compositional semantics with lexicalized tree-adjoining grammar (ltag) : How much underspecification is necessary ?, Proceedings of the Third International Workshop on Computational Semantics (IWCS-3), p.129, 1999.

S. Kahane, Grammaires de dépendance formelles et théorie sens-texte, 2001.

S. Kahane, Grammaire d'Unification Sens-Texte : Vers un modele mathématique articulé de la langue, p.135, 0129.

S. Kahane, On the status of the deep syntactic structure, Actes de la premì ere conférence internationale sur la Théorie Sens-Texte, p.177, 2003.
URL : https://hal.archives-ouvertes.fr/halshs-00120331

S. Kahane, Polarized unification grammars, Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the ACL , ACL '06, pp.137-144, 1920.
DOI : 10.3115/1220175.1220193

URL : http://acl.ldc.upenn.edu/P/P06/P06-1018.pdf

[. Kallmeyer, Using an enriched TAG derivation structure as basis for semantics Comparing lexicalized grammar formalisms in an empirically adequate way : The notion of generative attachment capacity, Proceedings of TAG+ 6 Workshop International Conference on Linguistic Evidence, pp.127-136, 2002.

M. Ronald, J. Kaplan, and . Bresnan, Lexical-functional grammar : A formal system for grammatical representation. Formal Issues in Lexical-Functional Grammar, pp.29-130, 1995.

. Kaplan, The parc 700 dependency bank, Proceedings of the EACL03 : 4th International Workshop on Linguistically Interpreted Corpora (LINC-03), pp.1-8, 2003.

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-58, 2003.
DOI : 10.1023/A:1024564228892

A. Koller and M. Kuhlmann, Dependency trees and the strong generative capacity of CCG, Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics on, EACL '09, pp.460-468, 2009.
DOI : 10.3115/1609067.1609118

M. L. Knittel, Le statut des compléments du nom en [de NP]. The Canadian Journal of Linguistics/La revue canadienne de linguistique, pp.255-290, 2009.

E. Kow, Réalisation de surface : ambigu¨?téambigu¨?té et déterminisme ? Surface realisation : ambiguity and determinism, p.118, 2007.

L. Kallmeyer and M. Romero, LTAG semantics with semantic unification Scope and situation binding in LTAG using semantic unification, Proceedings of TAG, pp.155-162, 2004.

M. Kuhlmann, Dependency Structures and Lexicalized Grammars : An Algebraic Approach, p.136, 2010.
DOI : 10.1007/978-3-642-14568-1

E. Keenan and D. Westerståhl, Generalized quantifiers in linguistics and logic, Handbook of logic and language, p.125, 2011.

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

J. Lambek, Type grammar revisited. Logical aspects of computational linguistics Vers une grammaire d'unification Sens-Texte du français : le temps verbal dans l'interface sémantique-syntaxe, pp.1-27, 1999.
DOI : 10.1007/3-540-48975-4_1

D. Robert, T. E. Levine, and . Hukari, The unity of unbounded dependency constructions. Number 166 in CSLI Lecture Notes. CSLI, p.133, 2006.

P. Lison, Implémentation d'une interface sémantique-syntaxe basée sur des grammaires d'unification polarisées, p.135, 2006.

S. Lehmann, S. Oepen, S. Regnier-prost, K. Netter, V. Lux et al., TSNLP, Proceedings of the 16th conference on Computational linguistics -, pp.711-716, 1996.
DOI : 10.3115/993268.993292

H. Maruyama-lluís, M. , X. Carreras, K. C. Litkowski, and S. Stevenson, Structural disambiguation with constraint propagation Semantic role labeling : an introduction to the special issue Dependency Syntax : theory and practice, Proceedings of the 28th annual meeting on Association for Computational Linguistics, pp.31-38, 1988.

[. Mel-'?-cuk, Lexical functions : a tool for the description of lexical relations in a lexicon. Lexical functions in lexicography and natural language processing, pp.37-102, 1996.

[. Bibliographie, B. Marchand, G. Guillaume, and . Perrier, Motifs de graphe pour le calcul de dépendances syntaxiquescompì etes, pp.27-168, 2010.

H. Philip and . Miller, Strong generative capacity. Number 103 in CSLI Lecture Notes, p.136, 1999.

[. Mitkov, Anaphora resolution. Longman, p.134, 2002.

T. John, R. M. Maxwell, and . Kaplan, An efficient parser for lfg, Proceedings of LFG, p.131, 1996.

M. Marneffe, B. Maccartney, and C. D. Manning, Generating typed dependency parses from phrase structure parses, Proceedings of LREC, p.138, 2006.

P. Mitchell, M. A. Marcus, B. Marcinkiewicz, and . Santorini, Building a large annotated corpus of english : The penn treebank, Computational linguistics, vol.19, issue.2, pp.313-330, 1993.

R. Montague, Universal grammar, Theoria, vol.26, issue.3, pp.373-398, 1970.
DOI : 10.1111/j.1755-2567.1970.tb00434.x

R. Montague, The proper treatment of quantification in ordinary English, pp.247-270, 1974.

U. Mönnich, Adjunction As Substitution : An Algebraic Formulation of Regular, Context-Free and Tree Adjoining Languages, Formal Grammar Conference, p.39, 1997.

M. Moortgat, Categorial investigations : logical and linguistic aspects of the Lambek calculus, p.74, 1988.

G. Morrill, Type logical grammar : categorial logic of signs, Computational Linguistics, vol.23, issue.67, p.128, 1994.
DOI : 10.1007/978-94-011-1042-6

G. Morrill, Categorial Grammar : Logical Syntax, Semantics, and Processing, p.16, 2010.

A. Nasr, A formalism and a parser for lexicalised dependency grammars, 4th International Workshop on Parsing Technologies, pp.186-195, 1995.

A. Nasr, Un modèle de reformulation automatique fondé sur la Théorie Sens Texte : Application aux langues contrôlées, p.16, 1996.

A. Nasr, Analyse syntaxique probabiliste pour grammaires de dépendances extraites automatiquement. HabilitationàHabilitationà diriger des recherches, p.67, 2004.

[. Nederhof, Practical Experiments with Regular Approximation of Context-Free Languages, Computational Linguistics, vol.26, issue.1, pp.17-44, 2000.
DOI : 10.1145/355598.362773

J. Nivre, L. Rimell, R. Mcdonald, C. Stuart, and M. Shieber, Evaluation of dependency parsers on unbounded dependencies Simpler tag semantics through synchronization SemTAG : une plate-forme pour le calcul sémantiquè a partir de Grammaires d'Arbres Adjoints, Proceedings of the 23rd International Conference on Computational Linguistics, pp.833-841, 2003.

. Habilitationàhabilitationà-diriger-les-recherches-en-informatique, 10 [Per07] Guy Perrier. A French Interaction Grammar The proposition bank : An annotated corpus of semantic roles, RANLP 2007, pp.463-467, 2005.

S. Padó and M. Lapata, Dependency-Based Construction of Semantic Space Models, Proceedings of the seventh international workshop on tree adjoining grammar and related formalisms (TAG+ 7), pp.161-199, 2004.
DOI : 10.1017/S135132490200298X

S. Pogodalla, Ambigu¨?téAmbigu¨?té de portée et approche fonctionnelle des grammaires d'arbres adjoints, Actes de la 14e conférence sur le Traitement Automatique des Langues Naturelles, pp.325-128, 2007.

S. Pogodalla, Generalizing a Proof-Theoretic Account of Scope Ambiguity
URL : https://hal.archives-ouvertes.fr/inria-00112898

C. J. Pollard, Generalized phrase structure grammars, head grammars and natural language, p.136, 1984.

C. J. Pollard, Strong generative capacity in hpsg. Lexical and constructional aspects of linguistic explanation, pp.281-297, 1999.

C. Pollard, Covert movement in logical grammar Logic and Grammar 128 [PP10] Sylvain Pogodalla and Florent Pompigne. Controlling extraction in abstract categorial grammars, 15th Conference on Formal Grammar -FG 2010, pp.17-40, 2010.

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

K. Geoffrey, B. C. Pullum, and . Scholz, On the distinction between modeltheoretic and generative-enumerative syntactic frameworks. Logical aspects of computational linguistics Unbounded dependency recovery for parser evaluation, Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing, pp.17-43, 2001.

[. Retoré, The logic of categorial grammars. Lecture notes ESSLLI, p.20, 2000.

M. Rezac, On tough-movement, Minimalist Essays Linguistik Aktuell/Linguistics Today 91, pp.288-325, 2006.
DOI : 10.1075/la.91.19rez

URL : https://hal.archives-ouvertes.fr/halshs-00605612

O. Rambow and A. K. Joshi, A formal look at dependency grammars and phrase-structure grammars, with special consideration of word-order phenomena. Recent trends in Meaning-Text Theory, pp.167-129, 1997.

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

J. Rogers, Syntactic structures as multi-dimensional trees, Research on Language and Computation, vol.1, issue.3/4, pp.265-305, 2003.
DOI : 10.1023/A:1024695608419

O. Rambow, K. Vijay-shanker, D. W. , A. Abeillé, and A. K. Joshi, D-tree grammars Parsing strategies with 'lexicalized' grammars : application to tree adjoining grammars Combinatory categorial grammar. Nontransformational Syntax : A Guide to Current Models, Proceedings of the 33rd annual meeting on Association for Computational Linguistics Proceedings of the 12th conference on Computational linguistics, pp.151-158, 1988.

N. Schluter-]-libin-shen, L. Champollion, and A. K. Joshi, Ltag-spinal and the treebank . Language Resources and Evaluation The tiger 700 rmrs bank : Rmrs construction from dependencies, Treebank-Based Deep Grammar Acquisition for French Probabilistic Parsing Resources Proceedings of LINC 2005 [SG05] Djamé Seddah and Bertrand Gaiffe. Des arbres de dérivation aux forêts de dépendance : un chemin via les forêts partagées Actes de TALN, pp.184-081, 2005.

M. Stuart and . Shieber, Evidence against the context-freeness of natural language, Linguistics and Philosophy, vol.8, issue.3, pp.333-343, 1985.

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-2006), pp.377-384, 2006.

M. Stuart, Y. Shieber, M. Stuart, and . Shieber-johan-van-benthem, Synchronous tree-adjoining grammars An alternative conception of tree-adjoining derivation 129 [Tes34] LucienTesnì ere Comment construire une syntaxe Language and Action : Categories, Lambdas and Dynamic Logic. North-Holland, 1991. 73 [vdEM03] Karel van den Eynde and Piet Mertens. La valence : l'approche pronominale et son application au lexique verbal, Proceedings of the 13th conference on Computational Proceedings of the 12th conference on Computational linguistics, pp.253-258, 1934.

[. Vijay-shanker, Using descriptions of trees in a tree adjoining grammar, Computational Linguistics, vol.18, issue.4 2, pp.481-517, 1992.

. [. Bibliographie, A. Vijay-shanker, D. J. Vijay-shanker, and . Weir, Feature structures based tree adjoining grammars The equivalence of four extensions of contextfree grammars [XTA95] The XTAG Research Group. A lexicalized tree adjoining grammar for english, Proceedings of the 12th conference on Computational linguistics- Theory of Computing Systems, pp.714-719511, 1988.