. Finally, to know how to express the semantics, at least two possibilities arise : to see it as for intuitionistic proof-nets [dGR96], or as having an alternative expression like with the derivation trees (trees that track the operations performed during a derivation)

A. Abeillé, Les nouvelles syntaxes, 1993.

A. Girard, Y. Lafont, and E. L. Regnier, Non-commutative proof nets Advances in Linear Logic, édité par J, Proceedings of the Workshop on Linear Logic, pp.271-296, 1993.

[. Abramson and V. Dahl, Logic Grammars. Symbolic Computation, 1989.

A. Adriaans, Language Learning from a Categorial Perspective, Thèse de doctorat, 1992.

C. Vito-michele-abrusci, J. Fouqueré, and . Vauzeilles, Tree adjoining grammars in non-commutative linear logic. Dans LACL'96, édité par Christian Retoré, volume 1328 de LNCS/LNAI, pp.96-117, 1996.

A. Ajdukiewicz, Die syntaktische Konnexitat English translation in, Polish Logic, pp.1-27, 1920.

H. Alshawi, The Core Language Engine, Series in Natural Language Processing, 1992.

V. M. , A. , and E. Maringelli, A new correctness criterion for cyclic proof nets, Journal of Logic, Language, and Information, vol.7, issue.4, pp.449-502, 1998.

D. Angluin, Inductive inference of formal languages from positive data, Information and Control, vol.45, issue.2, p.45, 1980.
DOI : 10.1016/S0019-9958(80)90285-5

A. Asperti, A linguistic approach to deadlock Rapport technique, 1991.

[. Bernardi, Polarity items in resocurce logics : A comparison, Proceedings of the Student Session, 2000.

Y. Bar-hillel, C. Gaifman, and E. E. Shamir, On categorial and phrase structure grammars. Dans Language and Information. Selected Essays on their Theory and Application , édité par Y. Bar-Hillel, pp.99-115, 1964.

[. Buszkowski and G. Penn, Categorial grammars determined from linguistic data by unification, Studia Logica, vol.65, issue.4, 1989.
DOI : 10.1007/BF00370157

[. Buszkowski, Discovery procedures for categorial grammar, Categories, Polymorphism, and Unification, édité par Ewan Klein et Johan van Benthem, pp.36-64, 1987.

[. Buszkowski, Generative power of categorial grammars. Dans Categorial Grammars and Natural Language Structures, pp.69-94, 1988.

[. Carpenter, Type-Logical Semantics, 1997.

[. Oehrle, Semantic categories and the development of categorial grammars, OBW88], pp.95-123

J. Chanod, Finite-state composition of french verb morphology. Rapport technique mltt-04, 1994.

[. Chomsky, Formal properties of grammars, Mathematical Psychology, vol.2, pp.323-418, 1963.

[. Cori and D. Lascar, Logique mathématique, volume I, 1993.

[. Cori and D. Lascar, Logique mathématique, volume II, 1993.

P. Chailloux, B. Manoury, and . Pagano, Développement d'applications avec Objective Caml, 2000.

J. Calder, M. Reape, and H. Zeevat, An algorithm for generation in Unification Categorial Grammar, Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics -, pp.233-240, 1989.
DOI : 10.3115/976815.976847

P. De and G. , The Curry-Howard Isomorphism, 1995.

P. De and G. , Partially commutative linear logic : sequent calculus and phase semantics . Dans Proofs and Linguistic Categories, Application of Logic tot the Analysis and Implementation of Natural Langugae Proceedings, pp.199-208, 1996.

P. De and G. , The non-associative lambek calculus with product in polynomial time. Dans Automatic Reasoning with Analytic Tableaux and Related Methods, édité par Neil V, Lecture Notes in Artificial Intelligence, vol.1617, pp.128-139
URL : https://hal.archives-ouvertes.fr/inria-00108070

P. De and G. , Linear higher-order matching is np-complete. Dans Rewriting Techniques and Applications, RTA'00, édité par L. Bachmair, LNCS, vol.1833, pp.127-140, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00099220

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

M. Dymetman and P. Isabelle, Reversible logic grammars for machine translation, proceedings of the 2nd International Conference on Theoretical and Methodological Issues in Machine Translation of Natural Languages, 1988.

J. Vincent-danos, H. Joinet, and . Schellinx, On the linear decoration of intuitionistic derivations, Archives for Mathematical Logic, vol.33, issue.6, 1994.

D. Dowty, Type raising, functional composition, and non-constituent conjunction. Dans Categorial Grammars and Natural Language Structures

G. Dowek, Third order matching is decidable, 7th Annual IEEE Symposium of Logic in Computer Science, pp.2-10, 1992.

G. Dowek, Higher-Order Unification and Matching, chapter 16, 2001.

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

R. David, R. E. Dowty, S. Wall, and . Peters, Introduction to Montague Semantics, 1981.

M. Dymetman, Inherently reversible grammars, logic programming and computability, proceedings of the ACL Workhop : Reversible Grammar in Natural Language Processing, 1991.

M. Dymetman, Transformations de Grammaires Logiques et Réversibilité, Thèse de doctorat, 1992.

M. Dymetman, Inherently reversible grammars. Dans Reversible Grammars in Natural Language Processing, édité par Tomek Strzalkowski, pp.33-57, 1994.

J. Earley, An efficient context-free parsing algorithm, Readings in Natural Language Processing, pp.25-33, 1986.

D. M. Gabbay, Labelled Deductive Systems. Oxford Logic Guides, 1996.

J. Gallier, On the Correspondence between Proofs and -Terms, p.55

]. P. Gea72 and . Geach, A program for syntax, Semantics of Natural Language, édité par D. Davidson et G. Harman, pp.483-497, 1972.

G. Gentzen, Investigations into logical deductions, The Collected Papers of Gerhard Gentzen, édité par M. E. Szabo, pp.68-131, 1935.

D. Gerdemann, Parsing and Generation of Unification Grammars, Thèse de doctorat, 1991.

[. Gerdemann and E. W. Hinrichs, Functor-driven natural language generation with categorial-unification grammars, Proceedings of the 13th conference on Computational linguistics -, pp.145-150, 1990.
DOI : 10.3115/997939.997964

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, Proof Theory and Logical Complexity, 1987.

J. Bonotto, R. Ferro, S. Valentini, and E. A. Zanardo, Geometry of interaction I : Interpretation of system F. Dans Logic Colloquium '88, édité par C, pp.221-260, 1989.

J. Girard, Geometry of interaction III: accommodating the additives, pp.329-389
DOI : 10.1017/CBO9780511629150.017

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Girard, Y. Lafont, and L. Regnier, Advances in Linear Logic, Proceedings of the Workshop on Linear Logic, 1993.
DOI : 10.1017/CBO9780511629150

[. Girard, Y. Lafont, and E. P. Taylor, Proofs and Types. Numéro 7 dans Cambridge Tracts in Theoretical Computer Science, 1988.

]. E. Gol67 and . Gold, Language identification in the limit, Information and Control, vol.10, pp.447-474, 1967.

D. Warren and . Goldfarb, The undecidability of the second-order unification problem, Theoretical Computer Science, vol.13, issue.2, 1981.

. Guerrini, Correctness of multiplicative proof nets is linear, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), 1999.
DOI : 10.1109/LICS.1999.782640

A. Haas, A generalization of the offline parsable grammars, Proceedings of the 27th annual meeting on Association for Computational Linguistics -, pp.237-242, 1989.
DOI : 10.3115/981623.981652

W. Howard, The Formulae-as-Types Notion of Construction, pp.479-490, 1980.

W. A. Howard and H. B. To, Curry : Essays on combinatory logic, Lambda Calculus and Formalism, chapter The Formulae-as-Types Notion of Construction, pp.479-490, 1980.

[. Hindley-et-jonathan, P. Seldin, and H. B. To, Curry : Essays on combinatory logic, Lambda Calculus and Formalism, 1980.

E. John, J. D. Hopcroft, and . Ullman, Introduction to Automata Theory, Languages and Computation, 1979.

P. Gérard and . Huet, The undecidability of unification in third order logic, Information and Control, vol.22, issue.3, 1973.

P. Gérard and . Huet, A unification algorithm for typed lambda -calculus, Theoretical Computer Science, vol.1, pp.27-57, 1975.

K. Aravind, S. Joshi, and . Kulick, Partial proof trees, resource sensitive logics and syntactic constraints. Dans LACL'96, édité par Christian Retoré, volume 1328 de LNCS/LNAI, pp.21-42, 1996.

K. Aravind, S. Joshi, and . Kulick, Partial proof trees as building blocks for a categorial grammar, Linguistics and Philosophy, vol.20, issue.6, pp.637-667, 1997.

K. Aravind, S. Joshi, and . Kulick, Partial proof trees, resource sensitive logics and syntactic constraints, Retoré [Ret97a], pp.21-42

K. Aravind, L. S. Joshi, M. Levy, and . Takahashi, Tree adjunct grammars, Journal of Computer and System Sciences, vol.10, issue.1, pp.136-163, 1975.

[. Johnson, Proof nets and the complexity of processing center embedded constructions, Journal of Logic, Language and Information, vol.7, issue.4, 1998.

J. Joinet, Étude de la normalisation du calcul des séquents classiques à travers la logique linéaire, Thèse de doctorat, 1993.

M. I. Kanovich, The multiplicative fragment of linear logic is NP-complete. ITLI Prepublication Series X-91-13, 1991.

M. Kanazawa, Identification in the limit of categorial grammars, Journal of Logic, Language and Information, vol.5, issue.2, pp.115-155, 1996.
DOI : 10.1007/BF00173697

[. Kanazawa, Learnable Classes of Categorial Grammars. CSLI and FoLLI, 1998.

L. Karttunen, Radical lexicalism Rapport Technique CSLI-86-68, 1986.

L. Karttunen, Constructing lexical transducers, Proceedings of the 15th conference on Computational linguistics -, 1994.
DOI : 10.3115/991886.991957

URL : http://acl.ldc.upenn.edu/C/C94/C94-1066.pdf

M. Kay, Chart generation, Proceedings of the 34th annual meeting on Association for Computational Linguistics -, pp.200-204, 1996.
DOI : 10.3115/981863.981890

M. Ronald, J. Kaplan, and . Bresnan, Lexical-Functional Grammar : A formal system for grammatical representation. Dans The Mental Representation of Grammatical Relations , édité par Joan Bresnan, pp.173-281, 1982.

L. Karttunen, J. Chanod, G. Grefenstette, and A. Schiller, Regular expressions for language engineering, Natural Language Engineering, vol.2, issue.4, pp.303-328, 1996.
DOI : 10.1017/S1351324997001563

L. Karttunen, R. M. Kaplan, and A. Zaenen, Two-level morphology with composition, Proceedings of the 14th conference on Computational linguistics -, 1992.
DOI : 10.3115/992066.992091

D. Kohl, Generation from under- and overspecified structures, Proceedings of the 14th conference on Computational linguistics -, pp.686-692, 1992.
DOI : 10.3115/992133.992176

P. Alexey and . Kopylov, Decidability of linear affine logic, Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science, pp.496-504, 1995.

J. Krivine, Lambda-calcul : types et modèles. Études et recherches en informatique, 1990.

]. D. Lad92 and . Ladd, An introduction to intonational phonology Dans Papers in Laboratory Phonology II : Gesture, Segment, Prosody, édité par G, pp.321-334, 1992.

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, On the calculus of syntactic types, Structure of Language and its Mathematical Aspects, édité par R. Jacobsen, Proceedings of Symposia in Applied Mathematics, XII, 1961.
DOI : 10.1090/psapm/012/9972

[. Lamarche, Proof nets for intuitionistic linear logic : Essantial nets. Rapport technique, Imperial College, 1994.

A. Lecomte, Proof-Nets and dependencies, Proceedings of the 14th conference on Computational linguistics -, pp.394-400, 1992.
DOI : 10.3115/992066.992130

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

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

J. Levy, Linear second-order unification, Proceedings of the 7th International Conference on Rewriting Techniques and Applications (RTA-96), édité par Harald Ganzinger , volume 1103 de LNCS, pp.332-346, 1996.
DOI : 10.1007/3-540-61464-8_63

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

P. Lincoln, J. Mitchell, A. Scedrov, . Et-natarajan, and . Shankar, Decision problems for propositional linear logic Annals of Pure and Applied Logic, Also in the Proceedings of the 31th Annual Symposium on Foundations of Computer Science Also available as Technical Report SRI-CSL-90-08 from SRI International, pp.239-311, 1990.

A. Lecomte and C. Retoré, Pomset logic as an alternative categorial grammar. Dans Formal Grammar, 1995.

[. Lamarche and C. Retoré, Proof-nets for the lambek calculus ? an overview, Proceedings 1996 Roma Workshop. Proofs and Linguistic Categories, édité par Vito Michele Abrusci et Claudio Casadio, pp.241-262, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00098442

A. Lecomte and C. Retoré, Words as Modules, International Conference on Mathematical Linguistics, 1996.
DOI : 10.1075/sfsl.45.14lec

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

A. Lecomte and C. Retoré, Logique de ressources et réseaux syntaxiques, pp.70-83, 1997.

A. Lecomte and C. Retoré, Towards a minimal logic for minimalism, Proceedings of Formal Grammar 1999, édité par Geert-Jan M. Kruijff et Richard T. Oehrle, 1999.

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

R. Mck85-]-kathleen and . Mckeown, Text Generation, Studies in Natural Language Processing, 1985.

M. Josep, G. V. Merenciano, and . Morrill, Generation as deduction on labelled proof nets, Retoré [Ret97a], pp.310-328

R. H. Möhring, Computationally tractable classes of ordered sets. Dans Algorithms and Order, édité par Ivan Rival, volume 255 de NATO ASI series C, Kluwer, pp.105-193, 1989.

N. Marti-oliet and J. Meseguer, From petri nets to linear logic. Dans Category Theory and Computer Science, LNCS, vol.389, pp.313-340, 1989.

R. Montague, Formal Philosophy : Selected Papers of Richard Montague, 1974.

M. Moortgat, Categorial Investigations : Logical and Linguistic Aspects of the Lambek Calculus, 1991.

M. Moortgat, Multimodal linguistic inference, Journal of Logic, Language, and Information, vol.54, issue.3, pp.349-385, 1996.
DOI : 10.1007/bf00159344

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

M. Moortgat, Categorial type logics, Benthem et Meulen [vBM97], pp.93-177
DOI : 10.1016/b978-0-444-53726-3.00002-5

M. Moortgat, Constants of grammatical reasoning, Constraints and Resources in Natural Language Syntax and Semantics

R. Moot, Grail : an interactive parser for categorial grammars, Proceedings of VEXTAL'99, pp.255-261, 1999.

G. V. Morrill, Type Logical Grammar Categorial Logic of Signs, 1994.

G. V. Morrill, Incremental Processing and Acceptability, Computational Linguistics, vol.26, issue.3, pp.319-338, 2000.
DOI : 10.1002/malq.19810271306

[. Moot and Q. Puite, Proof nets for multimodal categorial grammars, Proceedings of Formal Grammar 1999, édité par Geert-Jan M. Kruijff et Richard T. Oehrle, pp.103-114, 1999.

M. Masseron, C. Tollu, and E. J. Vauzeilles, Generating plans in linear logic, Theoretical Computer Science, vol.113, issue.2, pp.349-370, 1993.
DOI : 10.1016/0304-3975(93)90007-G

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

G. Neumann, A Uniform Computational Model for Natural Language Parsing and Generation, Thèse de doctorat, 1994.

J. Nicolas, Grammatical inference as unification, Rapport Technique, vol.3632, 1999.
URL : https://hal.archives-ouvertes.fr/inria-00073042

R. T. Oehrle, E. Bach, and D. Wheeler, Categorial Grammars and Natural Language Structures, 1988.
DOI : 10.1007/978-94-015-6878-4

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

C. N. Fernando and . Pereira, Categorial semantics and scoping, Computational Linguistics, vol.16, issue.1, pp.1-10, 1990.

[. Pinker, The Language Instinct. Penguin Books, 1995.

[. Pogodalla, Lexicalized proof nets in pomset logic and TAGs. Dans proceedings of Logical Aspects of Computational Linguistics Université Pierre Mendès- France (Grenoble 2) and LORIA, 1998.

S. Pogodalla, Génération à l'aide de réseaux de preuve sémantiques. Dans actes de Génération Automatique de Textes, Université Stendhal (Grenoble, vol.3, pp.77-91, 1999.

S. Pogodalla, Generation in the lambek calculus framework : an approach with semantic proof nets. Dans proceedings of the 1st Meeting of the North American Chapter, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00099268

S. Pogodalla, Generation, Lambek calculus, Montague's semantics and semantic proof nets, Proceedings of the 18th conference on Computational linguistics -, 2000.
DOI : 10.3115/992730.992737

S. Pogodalla, Generation with semantic proof nets, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00072775

J. Pollock, Langage et sognition Introduction au programme minimaliste de la grammaire générative. Psychologie et sciences de la pensée, 1997.

[. Pollard and I. Sag, Head-Driven Phrase Structure Grammar, Draft distributed at the Third European Summer School in Language, Logic and Information, 1991.

C. N. Fernando, . Pereira, H. D. David, and . Warren, Parsing as deduction, proceedings of the Annual Meeting of the Association for Computational Linguistics, pp.137-144, 1983.

[. Van-orman-quine, Le mot et la chose. Champs. Flammarion, 1999. Traduction française de Words and Objects, 1960.

A. Ranta, Syntactic calculus with dependent types, Journal of Logic, Language and Information, vol.7, issue.4, pp.413-431, 1998.
DOI : 10.1023/A:1008390927185

[. Regnier, VII, janvier 1992. [Ret93] Christian Retoré. Réseaux et séquents ordonnés, Thèse de doctorat Thèse de doctorat, 1993.

[. Retoré, Calcul de lambek et logique linéaire, pp.39-70, 1996.

[. Retoré, Perfect matchings and series-parallel graphs : multiplicatives proof nets as r&b-graphs. Dans Linear Logic 96 Tokyo Meeting, édité par, 1996.

[. Retoré, Logical Aspects of Computational Linguistics, First International Conference, LACL '96, 1996.
DOI : 10.1007/BFb0052147

[. Retoré, Pomset logic: A non-commutative extension of classical linear logic, LNCS, vol.97, issue.1210, pp.300-318, 1997.
DOI : 10.1007/3-540-62688-3_43

[. Retoré, Handsome proofnets : R&b-graphs, perfect matchings and seriesparallel graphs, 1999.

D. Roorda, Resource Logics : Proof-theoretical Investigations, Thèse de doctorat, 1991.

[. Retoré and E. Stabler, Resource logics and minimalist grammars, 1999.

P. Ruet, Concurrent constraint programming and non-commutative logic, Thèse de doctorat, 1997.
DOI : 10.1007/BFb0028028

A. Robinson and A. Voronkov, Handbook of Automated Reasoning, 2001.

[. Schabes, A. Abeillé, K. Et-aravind, and . Joshi, Parsing strategies with 'lexicalized' grammars, Proceedings of the 12th conference on Computational linguistics -, pp.579-583, 1988.
DOI : 10.3115/991719.991757

M. Stuart and . Shieber, A uniform architecture for parsing and generation, Proceedings of the 12th International Conference on Computational Linguistics, pp.614-619, 1988.

T. Shinohara, Inductive inference of monotonic formal systems from positive data, New Generation Computing, vol.22, issue.4, pp.371-384, 1991.
DOI : 10.1007/BF03037094

M. Stuart and . Shieber, The problem of logical-form equivalence, Computational Linguistics, vol.19, issue.1, pp.179-190, 1993.

M. Stuart, . Shieber, C. N. Fernando, L. Pereira, M. Karttunen et al., A compilation of papers on unification-based grammar formalisms, part ii. Rapport Technique CSLI-86-48, 1986.

M. Heine, B. Sørensen, and . Urzyczyn, Lectures on the curry-howard isomorphism Available as DIKU Rapport 98, 1998.

M. Stuart, H. Shieber, . Uszkoreit, C. N. Fernando, J. J. Pereira et al., The formalism and implementation of PATR-II, Research on Interactive Acquisition and Use of Knowledge. SRI International, 1983.

M. Stuart, . Shieber, R. C. Gertjan-van-noord, . Moore, C. N. Fernando et al., A semantic-head-driven generation algorithm for unification-based formalisms, proceedings of the Annual Meeting of the Association for Computational Linguistics, pp.7-17, 1989.

A. Tarski and . Logic, Semantics, Metamathematics : Papers from 1923-38, 1990.

I. Tellier, Learning to understand, 1998.

I. Tellier, Meaning helps learning syntax, Proceedings of the 4th International Colloquium on Grammatical Inference (ICGI-98), édité par Vasant Honavar et Giora Slutzki, volume 1433 de LNAI, pp.25-36, 1998.
DOI : 10.1007/BFb0054061

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

[. Tesnière, Éléments de syntaxe structurale, Éditions Klincksieck, 1988.

H. Uszkoreit, Categorial unification grammars Rapport Technique CSLI-86-66, 1986.
DOI : 10.3115/991365.991422

URL : http://acl.ldc.upenn.edu/C/C86/C86-1045.pdf

H. Uszkoreit and J. Van-benthem-johan-van-benthem, Categorial unification grammars The semantics of variety in categorial grammar Rapport Technique 83-29 Categorial grammar meets unification. Rapport Technique CSLI- 90-142 Handbook of Logic and Language, pp.187-194, 1983.

C. Van-eijck-et-robert and . Moore, Semantic Rules for English, chapter 5, 1992.

. Gertjan-van-noord, Reversibility in Natural Language Processing, Thèse de doctorat, 1993.

J. Wedekind, Generation as structure driven derivation, Proceedings of the 12th conference on Computational linguistics -, pp.732-737, 1988.
DOI : 10.3115/991719.991786

URL : http://acl.ldc.upenn.edu/C/C88/C88-2150.pdf

J. Wedekind, Some remarks on the decidability of the generation problem in lfgand patr-style unification grammars, proceedings of the Conference of the European chapter of the ACL, pp.45-52, 1995.

J. Wedekind, Semantic-driven generation with lfg-and patr-style grammars. Com- putatio9nal Linguistics, pp.277-281, 1999.

N. David and . Yetter, Quantales and (noncommutative) linear logic, Journal of Symbolic Logic, vol.55, issue.1, pp.41-64, 1990.