S. Abramsky, Computational interpretations of linear logic, Theoretical Computer Science, vol.111, issue.1-2, pp.3-5
DOI : 10.1016/0304-3975(93)90181-R

V. and M. Abrusci, Phase semantics and sequent calculusf o rp u r en o n c o m m u t a t i v e classical linear propositional logic, The Journal of Symbolic Logic, vol.6, issue.4, 1991.

V. , M. Abrusci, and P. Ruet, Non-commutative logic I: The multiplicative fragment . Annals of pure and applied logic, pp.2-9

M. Amblard, Calcul de représentations sémantiques et suntaxe générative: les grammaires minimalistes catégorielles.P h Dt h e s i s ,u n i v e r s i t éd eB o r d e a u x1

M. Amblard, A. Lecomte, and C. Retoré, Categorial minimalist grammars: From generative grammar to logical form. Linguistic Analysis, 2010.

D. Bechet, P. De-groote, and C. Retoré, Acom plet eaxiom at isat ionof the inclusion of series-parallel partial orders, Rewriting Techniques and Applications, RTA'97, pp.230-240, 1997.

P. De and G. , Partially commutative linear logic:s e q u e n tc a l c u l u sa n dp h a s e semantics, Third Roma Workshop: Proofs and Linguistics Categories ? Applications of Logic to the analysis and implementation of Natural Language, pp.9-9

S. Epstein and R. Berwick, On the convergence of 'minimalist' syntax and categorial grammar, Algebraic Methods in Language Processing.U n i v e r s i t e i tT w e n t e, pp.9-9

J. Girard, Linear logic. Theoretical Computer Science
URL : https://hal.archives-ouvertes.fr/inria-00075966

J. Girard, Y. Lafont, and P. Taylor, Proofs and Types.N u m b e r 7 i n Cambridge Tracts in Theoretical Computer Science, 1988.

A. Guglielmi, A system of interaction and structure, ACM Transactions on Computational Logic, vol.8, issue.1, 2007.
DOI : 10.1145/1182613.1182614
URL : https://hal.archives-ouvertes.fr/inria-00441254

J. S. Hodas and D. Miller, Logic programming in a fragment of intuitionistic linear logic. Information and computation

J. Lambek, The mathematics of sentence structure American mathematical monthly

A. Lecomte and C. Retoré, Extending Lambek grammars, Proceedings of the 39th Annual Meeting on Association for Computational Linguistics , ACL '01, 2001.
DOI : 10.3115/1073012.1073059

M. Masseron, C. Tollu, and J. Vauzeilles, Generating plans in linear logic: I. actions as proofs, Theoretical Computer Science
URL : https://hal.archives-ouvertes.fr/hal-00003530

R. Moot and C. Retoré, The logic of categorial grammars: a deductive account of natural language syntax and semantics,v o l u m e6 8 5 0o fLNCS.S p r i n g e r , 2012, pp.978-981
DOI : 10.1007/978-3-642-31555-8

S. Negri, A normalizing system of natural deduction for intuitionistic linear logic, Archive for Mathematical Logic
DOI : 10.1007/s001530100136

C. Retoré, Réseaux et Séquents Ordonnés, 1993.

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

C. Retoré, A description of the non-sequential execution of Petri nets in partially commutative linear logic, Logic Col loquium 99, 2004.
DOI : 10.1017/9781316755921.013

C. Retoré and E. Stabler, Generative grammar in resource logics, Research on Language and Computation, vol.22, issue.1, pp.3-5

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

E. Stabler and . Derivational-minimalism, In ChristianR e t o r é ,e d i t o r ,Logical Aspects of Computational Linguistics, LACL'96,v o l u m e1 3 2 8o fLNCS/LNAI, pp.6-8, 1997.