Monograph,
Habilitation and PhD
- Monograph:
the logic of categorial grammars: a
deductive account of natural language syntax and
semantics (R.
Moot & Ch. Retoré) july 2012 Springer LNCS 6850
This book is a contemporary and comprehensive introduction
to categorial grammars in the logical tradition initiated by
the work of Lambek. It guides students and researchers through
the fundamental results in the field, providing modern proofs
of many classic theorems, as well as original recent advances.
Numerous examples and exercises illustrate the motivations and
applications of these results from a linguistic, computational
and logical point of view. The Lambek calculus and its
variants, and the corresponding grammars, are at the heart of
these lecture notes. A chapter is devoted to a key feature of
these categorial grammars: their very elegant syntax-semantic
interface. In addition, we adapt linear logic proof nets to
these calculi since they provide efficient parsing algorithms
as exemplified in the Grail parser. This book shows how
categorial grammars weave together converging ideas from
formal linguistics, typed lambda calculus, Montague semantics,
proof theory and linear logic, thus yielding a coherent and
formally elegant framework for natural language syntax and
semantics
- Habilitation à Diriger des Recherches: Logique
linéaire et syntaxe des langues soutenue le 4 janvier 2002
(Président: A. Dikovsky , Rapporteurs: G. Huet, J. Lambek, M.
Moortgat, Examinateurs: C. Gardent, G. Kahn, J.-X. Rampon, O.
Ridoux)
- Réseaux
et séquents ordonnés (Doctorat de mathématiques, dirigé
par J.-Y. Girard et soutenu le 26 février 1993 à l'université
Paris 7)
Drafts, preprints, submitted, etc.
2013
2012
2011
2010
2008
2007
- Notes
de lecture sur: Two-Step Approaches to Natural Language
Formalisms, de Frank MORAWIETZ, (Editions Mouton de Gruyter,
2003, ISBN 978-3-11-017821-0.) Traitement Automatique des
Langues vol. 48 n° 3 pages 227-229
- Modèles algorithmiques de l'acquisition de la syntaxe :
concepts et méthodes, résultats et problèmes (avec D. Bechet, R.
Bonato, A. Dikovsky, A. Foret, Y. Le Nir, E. Moreau, I.
Tellier), Recherches Linguistiques de Vincennes, vol.
36, pages 123–152. octobre 2007.
- A Montagovian generative lexicon
(with Ch. Bassac and B. Mery) in Formal Grammar
2007, CSLI.
- An Automata-Theoretic Approach to
Minimalism (with G. Kobele and S. Salvati) In J. Rogers
and S. Kepser (ed) Model
Theoretic Syntax at 10
- A Montague based model for generative lexical semantics (with
Ch. Bassac and Bruno Mery) In R. Muskens (ed) New Directions inType Theoretic
Grammars. pages 90--97
- Non-Associative Categorial Grammars and Abstract Categorial
Grammars (with S. Salvati) In R. Muskens (ed) New Directions inType Theoretic
Grammars. pages 51--58
- Natural Deduction
and Normalisation For Partially Commutative Linear Logic and
Lambek Calculus with product (with M. Amblard) Computation
and Logic in the Real World (Computing in Europe 2007) In S. B.
Cooper and T. F. Kent and B. Löwe and A. Sorbi (eds) Quaderni
del Dipartimento di Scienze Matematiche e Informatiche "Roberto
Magari" ID487 pages 28--44.
2006
- Les indices pronominaux du
français dans les grammaires catégorielles. (avec Richard
Moot) Linguisticæ Investigationes, 29 :137–146,
2006.
- La linguistique computationnelle entre sciences cognitives et
traitement automatique des langues. (avec M. Amblard et Greg
Kobele). In Colloque de l’Association pour la Recherche
Cognitive, 2006. Poster.
- Toward a
knowledge representation model dedicated to the semantic
analysis of the sentence. (avec Jules Vanier, Christian
Bassac, Patrick Henry, Renaud Marlet) Technical Report RR-5951,
INRIA, 2006.
- A case study of
the convergence of mildly context-sensitive formalisms for
natural language syntax : from minimalist grammars to multiple
context-free grammars (avec Bruno Mery, Maxime Amblard,
Irène Durand) RR-6042, INRIA, 2006.
2005
2004
- A propos de l'ordre OSV en
LSF(avec Olivier de Langhe, Pierre Guitteny et Henri Portine)
SILEXICALES volume 4 pp. 115--130, 2004, CNRS.
- A description of the non-sequential execution of Petri nets in
partially commutative linear logic. In Jan van Eijck, Vinvent
van Oostrom, Albert Visser (eds) Logic Colloquium '99,
Association for Symbolic Logic & A.K. Peters, 2004. pp
152-181. See also INRIA
RR-4288
- Handsome Non-Commutative Proof-Nets: perfect matchings,
series-parallel orders and Hamiltonian circuits (with Sylvain
Pogodalla) Work presented at Categorial grammars 2004, LIRMM,
Montpellier, juin 2004.See also INRIA RR-5409
- L’interface entre syntaxe et séman- tique pour les
grammaires minimalistes catégorielles.(avec Maxime Amblard,
Alain Lecomte) In Journées Scientifiques Sémantique et
Modélisation, ENS-LSH Lyon, 2004.
- L’ordre des mots dans les grammaires catégorielles. (avec
Richard Moot) In Kim Gerdes and Claude Muller, editors,
Pré-Actes des Journées de la syntaxe : ordre des mots dans la
phrase française, positions et topologie, pages 56–59.
E.R.S.S.-C.N.R.S., 2004.
- Generative grammars in resource logics.(with Edward
Stabler) Research on Language and Computation, vol 2(1),
2004, pages 3–25. Version
préliminaire : RR-3780
- (edited volume with Edward Stabler) Resource
logics and minimalist grammars. Special issue of the
Research on Language and Computation, selected papers from the
RLMG‘99 workshop. Vol 2(1), 2004.
2003
- Sémantique dans les
grammaires minimalistes. (avec Alain Lecomte) Journées du
GDR Sémantique et Modélisation GDR 25-21, CNRS, Paris,
mars 2003.
- Handsome proof nets: perfect matchings and cographs.
Theoretical Computer Science. 294(3), 2003, pages 473–488
[Version complète RR 3652]
- Semantic aspects of minimalist
grammars (extended abstract, invited lecture) In F.
Spoto, G. Scollo, and A. Nijholt (eds), Algebraic Methods in
Language Processing – AMiLP 2003, Verona, vol. 21 of TWLT, p.
33–38. University Twente, 2003. Invited Lecture.
- Vers un traitement automatique
de la syntaxe et de la sémantique de la langue des signes.
(avec Olivier Delanghe, Pierre Guitteny, Henri Portine) Atelier
Traitement automatique des langues minoritaires et des petites
langues, TALN 2003, Batz-sur-mer, juin 2003.
- A propos des structures
OSV en Langue des Signes Française. (avec Olivier de
Langhe,Pierre Guitteny,Henri Portine) In Anne-Marie Berthonneau
and Georgette Dal, editors, Journées d’études internationales
– La linguistique de la LSF : recherches actuelles. SILEX-
C.N.R.S., 2003.
- Syntax
and semantics interacting in a minimalist theory. (avec
Maxime Amblard, Alain Lecomte) In Denys Duchier, editor,
Prospects and Advances in the Syntax/Semantics Interface, pages
17–22, Nancy, 2003.
2002
2001
- (edited volume with Philippe de Groote
and Glyn Morrill) Logical
Aspects of Computational Linguistics, LACL’01, vol. 2099
of LNCS/LNAI, Springer, 2001.
- Learning rigid
Lambek grammars and minimalist grammars In Popelìnsky`
and Miloslev Nepil, editors. Procee- dings of the third workshop
on Learning Language in Logic, LLL 01, number FI-MU-RS-2001-08
in FI MU Report series, Strabourg, September 2001. Faculty of
Informatics – Masaryk University. pages 23–34.
- Extending
Lambek grammars: a logical account of minimalist
grammars In Proceedings of the 39th Annual Meeting
of the Association for Computational Linguistics, ACL 2001,
pages 354–361, Toulouse, July 2001. ACL.
- Systèmes déductifs et traitement des langues:un panorama des
grammaires catégorielles Technique et Science Informatique (TSI)
2001/3 pp. 11-46 numéro thématique Traitement Automatique du
Langage Naturel sous la direction de D. Kayser et B. Levrat. [Version
préliminaire RR-3917]
1999
1998
- Words as modules : a
lexicalized grammar in the framework of linear logic proof
nets. (with Alain Lecomte) In Carlos Martin-Vide, editor,
Mathematical and Computa- tional Analysis of Natural Language —
selected papers from ICML‘96, vol. 45 of Studies in Func- tional
and Structural Linguistics, John Benjamins publishing company,
pp. 129–144.
- (edited volume) Recent
Advances in Logical and Algebraic Approaches to Grammar
Special issue of the Journal of Logic, Language and
Information, selected papers from the LACL’95 workshop. vol.
7, issue 4, 1998. [Inclut une préface de 4 pages.]
- Pomset logic as a calculus of directed cographs In M. Abrusci,
C. Casadio and G. Sandri eds, Fourth Roma Workshop : Dynamic
perspectives in Logic and Linguistics., CLUEB, 1998. [Complete
version RR-3714]
Invited lecture.
1997
- (edited volume) Logical
Aspects of Computational Linguistics, LACL`96, selected
papers. Volume 1328 of Springer LNCS/LNAI
- Logical Aspects of
Computational Linguistics : an introduction (avec P.
Blackburn, M. Dymetman, A. Lecomte, A. Ranta, E.
Villemonte de la Clergerie ) In Ch. Retoré, editor.
Logical Aspects of Computational Linguistics, LACL’96, selected
papers, vol. 1328 of LNCS/LNAI, Springer, 1997. Pages 1–20.
Introduction de vingt pages au thème de la conférence,
rédigée à la demande de Springer.
- A semantic characterisation of the correctness of a proof net.
Mathematical Structures in Computer Science, 7(5) :445–452,
1997. [Version
complète : RR-2430]
- A complete
axiomatisation for the inclusion of series-parallel partial
orders (with Denis Bechet, Philippe de Groote) in H.
Comon, editor, Rewriting Techniques and Applications, RTA’97,
pages 230–240, vol. 1232 of LNCS, Springer 1997.
- Logique des
ressources et réseaux syntaxiques. In D. Genthial,
éd., 4 ème Traitement automatique du langage naturel, TALN’97,
pages 70–83, Pôle Langage Naturel, Grenoble, Juin 97.
- Pomset
logic: a non-commutative extension of classical linear logic In
J. R. Hindley and Ph. de Groote, editors, Typed Lambda Calculus
and Applications, TLCA’97, pages 300–318, vol. 1210 of LNCS,
Springer 1997.
1996
- Perfect matching and series
parallel graphs: multiplicative proof nets as R&B-graphs
In J.-Y. Girard, M. Okada and A. Scedrov, editors, Linear’96, Electronic
Notes in Theoretical Computer Science, 3, 1996. 16 pages.
- Calcul de Lambek
et Logique Linéaire Traitement Automatique des Langues, 37(2)
: 39–70, 1996.
- Semantic
readings of proof nets (avec Philippe de Groote) In
Geert-Jan Kruijff, Glyn Morrill, and Dick Oehrle, editors,
Formal Grammar, pages 57–70, Prague, August 1996. FoLLI.
- Proof nets
for the Lambek calculus - an overview ( with François Lamarche
) In M. Abrusci and C. Casadio editors, Third
Roma Workshop : Proofs and Linguistic Categories, CLUEB :
Bologna, 1996. p. 241–262.
- Words as
Modules and Modules as Partial Proof-Nets in a Lexicalized
Grammar (avec Alain Lecomte) In M. Abrusci and C. Casadio
eds, Third Roma Workshop : Proofs and Linguistic Categories,
CLUEB : Bologna, 1996. p. 187–199.
1995
1994
- The mix rule (with Arnaud Fleury). Mathematical Structures
in Computer Science, 4(2) :273–285, June 1994.
- On the relation
between coherence semantics and multiplicative proof nets
INRIA Research Report 2430
- A note on
intersection types INRIA Research Report 2431
- Une modalité
autoduale pour le connecteur précède INRIA Research Report
2432.
- Une modalité
autoduale pour le connecteur « précède ». In
Pierre Ageron, éditeur, Catégories, Algèbres, Esquisses et
Néo-Esquisses, pages 11–16, Publications du Département de
Mathématiques, Université de Caen, septembre 1994.
[Version complète : RR-2432]
1993
1992