A. Abeillé, Les nouvelles syntaxes, 1993.

V. and M. Abrusci, Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic, The Journal of Symbolic Logic, vol.55, issue.04, pp.1403-1451, 1991.
DOI : 10.1090/conm/092/1003197

V. , M. Abrusci, C. Fouqueré, and J. Vauzeilles, Tree adjoining grammar and non-commutative linear logic, Retoré [75], pp.13-17
DOI : 10.1007/bfb0052153

V. , M. Abrusci, and P. Ruet, Non-commutative logic i: the multiplicative fragment, Annals of Pure and Applied Logic, vol.101, issue.1, pp.29-64, 1999.
DOI : 10.1016/s0168-0072(99)00014-7
URL : http://doi.org/10.1016/s0168-0072(99)00014-7

P. Adriaans, Grammar Induction as Substructural Inductive Logic Programming, Learning Language in Logic workshop, pp.117-127, 1999.
DOI : 10.1007/3-540-40030-3_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.4182

K. Ajdukiewicz, Die syntaktische konnexität, Studia Philosophica, vol.1, pp.1-27, 1935.

Y. Bar, A quasi arithmetical notation for syntactic description, Language, vol.29, pp.47-58, 1953.

Y. Bar-hillel, C. Gaifman, and E. Shamir, On categorial and phrase-structure grammars. Bulletin of the research council of Israel, pp.1-16, 1963.

P. Blache, Spécifications de contraintes syntaxiques par filtrage de réseaux de preuve Rapport de recherche, Université d'Aix-en-Provence, 1999.

P. Blackburn, M. Dymetman, and A. Lecomte, Aarne Ranta, Christian Retoré, and Eric Villemonte de la Clergerie. Logical aspects of computational linguistics: an introduction, Retoré [75], pp.1-20

W. Buszkowski, Mathematical Linguistics and Proof Theory, van Benthem and ter Meulen [90], chapter 12, pp.683-736
DOI : 10.1016/B978-044481714-3/50016-3

W. Buszkowski and G. Penn, Categorial grammars determined from linguistic data by unification, Studia Logica, vol.65, issue.4, pp.431-454, 1990.
DOI : 10.1007/BF00370157

N. Chomsky, Formal properties of grammars, Handbook of Mathematical Psychology, pp.323-418, 1963.

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

T. Cornell, Derivational and Representational Views of Minimalist Transformational Grammar, Logical aspects of computational linguistics: Second International Conference, LACL '97, 1997.
DOI : 10.1007/3-540-48975-4_5

M. Dalrymple, J. Lamping, F. Pereira, and V. Saraswat, Linear logic for meaning assembly, Morrill and Oehrle [60], pp.75-93

D. Groote, An algebraic correctness criterion for intuitionistic proof-nets, Logical Fundations of Computer Science, LFCS'97, pp.130-140, 1997.
DOI : 10.1007/3-540-63045-7_14
URL : https://hal.archives-ouvertes.fr/inria-00098817

P. De and G. , Partially commutative linear logic: sequent calculus and phase semantics, Abrusci and Casadio, pp.199-208

P. De, G. , and C. Retoré, Semantic readings of proof nets, Formal Grammar, pp.57-70, 1996.
URL : https://hal.archives-ouvertes.fr/hal-00823554

D. Duchier and C. Gardent, A constraint-based treatment of descriptions, ICOS'99 (Inference in Computational Semantics), 1999.

J. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

J. Girard, Linear Logic: its syntax and semantics, Advances in Linear Logic, pp.1-42, 1995.
DOI : 10.1017/CBO9780511629150.002

J. Girard, Y. Lafont, and P. Taylor, Proofs and Types. Number 7 in Cambridge Tracts in Theoretical Computer Science, 1988.

L. R. Gleitman and E. L. Newport, The invention of language by children: Environmental and biological influences on the acquisition of language, Gleitman and Liberman, pp.1-24

E. M. Gold, Language identification in the limit, Information and Control, vol.10, issue.5, pp.447-474, 1967.
DOI : 10.1016/S0019-9958(67)91165-5

M. Hepple, The Grammar and Processing of Order and Dependency, a categorial approach, 1990.

D. Heylen, Types and Sorts ? Resource Logic for Feature Checkimg, 1999.

E. Mark and . Johnson, Proof nets and the complexity of processing centerembedded constructions, Journal of Logic Language and Information, vol.7, issue.4, pp.433-447, 1998.

A. Joshi and S. Kulick, Partial proof trees as building blocks for a categorial grammar, pp.138-149

A. Joshi and S. Kulick, Partial proof trees, resource sensitive logics and syntactic constraints, Retoré [75], pp.21-42
DOI : 10.1007/BFb0052149

A. Joshi and Y. Schabes, Tree-Adjoining Grammars, Rozenberg and Salomaa
DOI : 10.1007/978-3-642-59126-6_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.502

A. Joshi, K. Vijay-shanker, and D. Weir, The convergence of mildly context-sensitive grammar formalisms, Fundational issues in natural language processing, 1991.

M. Kanazawa, Learnable classes of categorial grammars Studies in Logic, Language and Information. FoLLI & CSLI, 1998.

E. Kraak, A deductive account of french objects clitics, SYntax and Semantics, vol.30, pp.271-312, 1998.

N. Kurtonina and M. Moortgat, Structural control, Specifying Syntactic Structures, pp.75-113, 1997.

F. Lamarche and C. Retoré, Proof nets for the lambek calculus ? an overview, Abrusci and Casadio, pp.241-262
URL : https://hal.archives-ouvertes.fr/inria-00098442

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

J. Lambek, On the calculus of syntactic types, Structure of language and its mathematical aspects, pp.166-178
DOI : 10.1090/psapm/012/9972

A. Lecomte, Proof-Nets and dependencies, Proceedings of the 14th conference on Computational linguistics -, pp.394-401, 1992.
DOI : 10.3115/992066.992130
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.9700

A. Lecomte, Grammaire et théorie de la preuve: une introduction, pp.1-38, 1996.

A. Lecomte, Proof-nets, hybrid logics and minimalist representations, Mathematics of Language 6, 1999.

A. Lecomte and C. Retoré, Pomset logic as an alternative categorial grammar, pp.181-196

A. Lecomte and C. Retoré, Words as Modules, Mathematical and Computational Analysis of Natural Language ? selected papers from ICML'96 of Studies in Functional and Structural Linguistics, pp.129-144, 1998.
DOI : 10.1075/sfsl.45.14lec
URL : https://hal.archives-ouvertes.fr/inria-00098440

A. Lecomte and C. Retoré, Towards a minimal logic for minimalist grammars: Another use of lambek calculus, Formal Grammar, FG'99, pp.83-92, 1999.

M. Légeret, Algèbres de démonstrations en grammaires catégorielles, Thèse de Doctorat, spécialité Mathématiques, 1996.

J. Maria, M. , and G. Morrill, Generation as deduction, Retoré [75], pp.77-80

J. Michaelis, Derivational Minimalism Is Mildly Context???Sensitive, Moortgat [55]
DOI : 10.1007/3-540-45738-0_11

R. Montague, The collected papers of Richard Montague, edited and with an introduction by Richmond Thomason, 1974.

M. Moortgat, Categorial type logic, van Benthem and ter Meulen [90], chapter 2, pp.93-177
DOI : 10.1016/b978-0-444-53726-3.00002-5
URL : https://hal.archives-ouvertes.fr/inria-00000314

/. Lnai, Logical Aspects of Computational Linguistics, LACL'98, selected papers, LNCS, 1999.

R. Moot, Grail: An automated proof assistant for categorial grammar logics, Proceedings of the 1998 User Interfaces for Theorem Provers Conference, pp.120-129, 1998.

R. Moot, User's guide to Grail 2.0. Manuscript, 1998.

R. Moot and Q. Puite, Proof-nets for the multimodal lambek calculus, Formal Grammar '99. FoLLI, 1999.

G. Morrill, Incremental Processing and Acceptability, Computational Linguistics, vol.26, issue.3, 1998.
DOI : 10.1002/malq.19810271306
URL : http://acl.ldc.upenn.edu/J/J00/J00-3002.pdf

G. V. Morrill, Type Logical Grammar, 1994.
DOI : 10.1007/978-94-011-1042-6

J. Nicolas, Grammatical inference as unification Rapport de Recherche RR-3632, INRIA, 1999.

B. Partee, Montague grammar, van Benthem and ter Meulen [90], chapter 1, pp.5-92
DOI : 10.1016/b0-08-043076-7/02954-5

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

M. Pentus, Abstract, The Journal of Symbolic Logic, vol.2, issue.02, pp.648-660, 1997.
DOI : 10.1016/S0019-9958(67)91172-2

G. Perrier, Labelled proof nets for the syntax and semantics of natural languages, Logic Journal of IGPL, vol.7, issue.5, pp.629-654, 1999.
DOI : 10.1093/jigpal/7.5.629
URL : https://hal.archives-ouvertes.fr/inria-00098572

G. Perrier, From intuitionistic proof nets to interaction grammars, 1999.
URL : https://hal.archives-ouvertes.fr/inria-00098793

S. Pinker, Language acquisition, pp.135-182

S. Pogodalla, Ltags and pomset logic, Moortgat [55]

S. Pogodalla, Generation with semantic proof-nets Rapport de recherche, 2000.

J. Pollock, Langage et cognition: le programme minimaliste de la grammaire générative, 1997.
DOI : 10.3917/puf.pollo.1998.01

C. Retoré, Calcul de lambek et logique linéaire, Traitement Automatique des Langues, vol.37, issue.2, pp.39-70, 1996.

C. Retoré, Pomset logic: A non-commutative extension of classical linear logic, Typed Lambda Calculus and Applications, TLCA'97, pp.300-318, 1997.
DOI : 10.1007/3-540-62688-3_43

C. Retoré and E. Stabler, Resource logics and minimalist grammars: introduction Resource Logics and Minimalist Grammars, European Summer School in Logic Language and Information, 1999.

D. Roorda, Resource logic: proof theoretical investigations, 1991.

G. Rozenberg and A. Salomaa, Handbook of Formal Languages, 1997.

P. Ruet, Logique non-commutative et programmation concurrente Thèse de doctorat, spécialité logique et fondements de l'informatique, 1997.

Y. Sakakibara, Recent advances of grammatical inference, Theoretical Computer Science, vol.185, issue.1, pp.15-45, 1997.
DOI : 10.1016/S0304-3975(97)00014-5

P. Sébillot, Modélisation de filtrage par arbres et par traits dans les grammaires logiques pour l'analyse automatique du langage naturel, Thèse de doctora, spécialité informatique, Institut National des Sciences Appliquées, 1989.

D. D. Sleator and D. Temperley, Parsing English with a link grammar Available through, Third International Workshop on Parsing Technologies, 1993.

G. Smolka, The Oz Programming Model, Computer Science Today, Lecture Notes in Computer Science, vol.1000, pp.324-343, 1995.
DOI : 10.1007/BFb0015252

E. Stabler, Derivational minimalism, Retoré [75], pp.68-95
DOI : 10.1007/BFb0052152
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.3127

M. Steedman, Combinators and Grammars, Categorial Grammars and Natural Language Structures. Reidel, 1988.
DOI : 10.1007/978-94-015-6878-4_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.371.8957

I. Tellier, Meaning helps learning syntax, Fourth International Colloquium on Grammatical Inference, ICG'98, 1998.
DOI : 10.1007/BFb0054061
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.3124

H. Tiede, Lambek Calculus Proofs and Tree Automata
DOI : 10.1007/3-540-45738-0_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.1144

A. Sjerp and T. , Lectures on Linear Logic, volume 29 of CSLI Lecture Notes. CSLI, 1992

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

W. Vermaat, Controlling Movement: Minimalism in a Deductive Perspective, 1999.

W. Zielonka, Axiomatizability of the Adjukiewicz-Lambek calculus by means of cancellation schemes, Zeitschrift für matematische Logik und Grundlagen der Mathematik, pp.539-548, 1982.

R. , U. De-recherche, I. Lorraine, V. Technopôle-de-nancy-brabois, I. Lès-nancy-unité-de-recherche et al., Campus scientifique, 615 rue du Jardin Botanique Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unité de recherche INRIA Rhône-Alpes, p.78153, 2004.