R. Bernardi and R. Moot, Generalized Quantifiers in Declarative and Interrogative Sentences, Logic Journal of IGPL, vol.11, issue.4, pp.419-434, 2003.
DOI : 10.1093/jigpal/11.4.419
URL : https://hal.archives-ouvertes.fr/hal-00278795

R. Bernardi and A. Szabolsci, Optionality, Scope, and Licensing: An Application of Partially Ordered Categories, Journal of Logic, Language and Information, vol.20, issue.4, 2007.
DOI : 10.1007/s10849-008-9060-y

V. Danos and L. Regnier, The structure of multiplicatives, Archive for Mathematical Logic, vol.28, issue.3, pp.181-203, 1989.
DOI : 10.1007/BF01622878

P. De and G. , An algebraic correctness criterion for intuitionistic multiplicative proof-nets, Theoretical Computer Science, vol.224, issue.12, pp.115-134, 1999.
URL : https://hal.archives-ouvertes.fr/inria-00098817

D. Heylen, Types and Sorts: Resource Logic for Feature Checking, 1999.

J. Hopcroft and R. Karp, An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs, SIAM Journal on Computing, vol.2, issue.4, pp.225-231, 1973.
DOI : 10.1137/0202019

M. Kanovich, The multiplicative fragment of linear logic is NP-complete, 1991.

F. Lamarche, Proof nets for intuitionistic linear logic I: Essential nets, 1994.

F. , X. Lloré, and G. Morrill, Difference lists and difference bags for logic programming of categorial deduction, Proceedings of SEPLN XI, Deusto, 1995.

M. Moortgat, Categorial type logics, Handbook of Logic and Language, pp.93-177, 1997.

M. Moortgat, Constants of grammatical reasoning, Constraints and Resources in Natural Language Syntax and Semantics, pp.195-219, 1999.

M. Moortgat and R. T. Oehrle, Adjacency, dependency and order, Proceedings 9th Amsterdam Colloquium, pp.447-466, 1994.

R. Moot, Automated extraction of type-logical supertags from the Spoken Dutch Corpus, Complexity of Lexical Descriptions and its Relevance to Natural Language Processing: A Supertagging Approach, 2007.

R. Moot, Graph algorithms for improving type-logical proof search, Proceedings Categorial Grammars 2004: an Efficient Tool for Natural Language Processing, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00012408

R. Moot and M. Piazza, Linguistic applications of first order multiplicative linear logic, Journal of Logic, Language and Information, vol.10, issue.2, pp.211-232, 2001.
DOI : 10.1023/A:1008399708659

R. Moot and Q. Puite, Proof nets for the multimodal Lambek calculus, Studia Logica, vol.71, issue.3, pp.415-442, 2002.
DOI : 10.1023/A:1020525032763

R. Moot and C. Retoré, Les indices pronominaux du français dans les grammaires catégorielles, Lingvisticae Investigationes, vol.29, issue.1, pp.137-146, 2006.

M. Pentus, Lambek calculus is NP-complete, Theoretical Computer Science, vol.357, issue.1-3, pp.186-201, 2006.
DOI : 10.1016/j.tcs.2006.03.018
URL : http://doi.org/10.1016/j.tcs.2006.03.018

J. Régin, A filtering algorithm for constraints of difference in CSPs, Proceedings of the Twelfth National Conference on Artificial Intelligence, pp.362-367, 1994.

Y. Schabes and K. Vijay-shanker, Deterministic left to right parsing of Tree Adjoining Languages, Proceedings of the 28th annual meeting on Association for Computational Linguistics -, pp.276-283, 1990.
DOI : 10.3115/981823.981858