Skip to Main content Skip to Navigation

Jeux de typage et analyse de lambda-grammaires non-contextuelles

Pierre Bourreau 1
1 Méthodes Formelles
LaBRI - Laboratoire Bordelais de Recherche en Informatique
Abstract : Abstract categorial grammars (or, equivalently, lambda-grammars) is formalism based on the simply-typed lambda-calculus. These grammars can be described as grammars of such terms and were introduced in order to bring a model of the syntax-semantics interface in natural language, based on two main ideas: the distinction between the tectogrammatical (i.e. the deep structure of an utterance) and phenogrammatical (i.e. the interpretation of this structure) levels in natural languages, which was expressed by Curry; and an algebraic modeling of the principle of compositionality in order to give account of the semantics of a sentence. an idea formalized by Montague. One of the main advantages of abstract categorial grammars is that both the problems of natural language parsing and generation can be tackled under the same problem: parsing abstract categorial grammars. Efficient algorithms were discovered for abstract categorial grammars of linear and almost linear lambda-terms, while it is known the recognition problem is decidable but non-elementary in general. This work focuses on the study of classes of terms for which parsing can still be solved in polynomial time. The results we give are mainly based on two theorems: the coherence theorem which specifies that a given lambda-term in the desired class must be the unique inhabitant of one of its typing; and the subject expansion theorem, which states that two beta-equivalent terms of the desired class must inhabit the same typings. In order to lead the study, we use an alternative representation of both simply-typed lambda-terms and their typings as games. In particular, we will use this representation in order to prove the coherence theorems for new classes of lambda-terms. Thanks to these results, we will show it is possible to build in a direct way, recognizers for grammars of almost affine lambda-terms as Datalog programs.
Complete list of metadata

Cited literature [116 references]  Display  Hide  Download
Contributor : Pierre Bourreau <>
Submitted on : Thursday, September 20, 2012 - 2:31:28 PM
Last modification on : Thursday, January 11, 2018 - 6:26:55 AM
Long-term archiving on: : Friday, December 21, 2012 - 3:49:49 AM


  • HAL Id : tel-00733964, version 1



Pierre Bourreau. Jeux de typage et analyse de lambda-grammaires non-contextuelles. Informatique et langage [cs.CL]. Université Sciences et Technologies - Bordeaux I, 2012. Français. ⟨tel-00733964⟩



Record views


Files downloads