A Datalog recognizer for almost affine lambda-CFGs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

A Datalog recognizer for almost affine lambda-CFGs

Résumé

The recent emergence of linguistic formalisms exclusively based on the simply-typed λ-calculus to represent both syntax and semantics led to the presentation of innovative techniques which apply to both the problems of parsing and generating natural languages. A common feature of these techniques consists in using strong relations between typing properties and syntactic structures of families of simply-typed λ-terms. Among significant results, an efficient algorithm based on Datalog programming is presented in [Kan07] for context-free grammar of almost linear λ-terms, which are linear λ-terms augmented with a restricted form of copy. We present an extension of this method to terms for which deletion is allowed.
Fichier principal
Vignette du fichier
parseAffine.pdf (202.46 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00740701 , version 1 (10-10-2012)

Identifiants

Citer

Pierre Bourreau, Sylvain Salvati. A Datalog recognizer for almost affine lambda-CFGs. Mathematics of Language, Sep 2011, Nara, Japan. pp.21-38, ⟨10.1007/978-3-642-23211-4⟩. ⟨hal-00740701⟩
322 Consultations
206 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More