Words as modules: a lexicalised grammar in the framework of linear logic proof nets.
Résumé
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.