A Datalog recognizer for almost affine lambda-CFGs

Abstract : 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.
Document type :
Conference papers
Springer. Mathematics of Language, Sep 2011, Nara, Japan. 6878, pp.21-38, 2011, <10.1007/978-3-642-23211-4>


https://hal.archives-ouvertes.fr/hal-00740701
Contributor : Pierre Bourreau <>
Submitted on : Wednesday, October 10, 2012 - 4:44:46 PM
Last modification on : Tuesday, October 28, 2014 - 6:57:34 PM

File

parseAffine.pdf
fileSource_public_author

Identifiers

Citation

Pierre Bourreau, Sylvain Salvati. A Datalog recognizer for almost affine lambda-CFGs. Springer. Mathematics of Language, Sep 2011, Nara, Japan. 6878, pp.21-38, 2011, <10.1007/978-3-642-23211-4>. <hal-00740701>

Export

Share

Metrics

Consultation de
la notice

109

Téléchargement du document

45