In this talk, we shall give an overview of our work concerning type-logical grammars.

These frameworks are used in computational linguistics to model syntax using a strongly lexicalized style, properties (logical types) beeing attached directly to words. Type-logical grammars are also connected with logic, especially linear logic. For instance, parsing a sentence is similar to searching a proof, and semantics can be transparently mapped onto structure in the style of the Curry-Howard isomorphism.

A significant part of this work is connected to automatic acquisition (learning, grammatical inference) issues, and possibilities to help in the design of valuable grammars.

In more details, among the formal and computational issues underlying these systems and some specific subclasses, we have been involved in these questions:

A lot of this work has been performed in collaboration, in particular with the Gracq group (ARC Inria "acquisition de grammaires catégorielles"), then with the TALN team at LINA and with the LIS team at Irisa; on the computational side, we have also taken part in the design of prototypes, in collaboration with these two teams; small demos are possible.

Alexander Clark, university "Royal Holloway" of London, UK (reviewer)
Marie-Odile Cordier, university of Rennes 1 (jury president)
Alexandre Dikovsky, university of Nantes
Alain Lecomte, university of Paris 8  (reviewer)
Gerald Penn, university of Toronto, Canada  (reviewer)
Christian Retoré, university of Bordeaux 1
Olivier Ridoux, university of Rennes 1