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

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

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

J. Hockenmaier, Data and Models for Statistical Parsing with Combinatory Categorial Grammar, 2003.
DOI : 10.3115/1073083.1073139
URL : http://acl.ldc.upenn.edu/P/P02/P02-1043.pdf

M. Kanovich, The multiplicative fragment of linear logic is NPcomplete . Tech. rep., University of Amsterdam. ITLI Prepublication Series X, pp.91-104, 1991.

F. Lloré, G. Xavier, and . 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.
DOI : 10.1016/b978-0-444-53726-3.00002-5

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, 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 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

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