Words as modules: a lexicalised grammar in the framework of linear logic proof nets.

Alain Lecomte 1 Christian Retoré
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present a syntactic calculus relying on the notion of proof net, ie. a geometric representation for proofs in linear logic. The lexicon associates a module or partial proof net with each word, and this information completely encodes the syntactic behavior of the word. Parsing a sentence consists in combining the modules associated withits words into a complete proof net. In order to handle word order, this model takes place in a non-commutative extension of linear logic called Pomset logic.
Mots-clés : Logique linéaire categorial grammar Linear logic grammaire catégorielle
Document type :
Conference papers
Complete list of metadatas
https://hal.inria.fr/inria-00098440
Contributor : Publications Loria <>
Submitted on : Monday, September 25, 2006 - 5:01:30 PM
Last modification on : Thursday, November 8, 2018 - 11:48:02 AM

Identifiers

  • HAL Id : inria-00098440, version 1

Collections

INRIA | LORIA | UNIV-LORRAINE

Citation

Alain Lecomte, Christian Retoré. Words as modules: a lexicalised grammar in the framework of linear logic proof nets.. Mathematical & Computational Analysis of Natural Language (Proceedings of International conference on mathematical linguistics II), 1998, Tarragone, pp.129-144. ⟨inria-00098440⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

134

Contact


archive-ouverte@inria.fr