The IO and OI hierarchies revisited

Abstract : We study languages of lambda-terms generated by IO and OI unsafe grammars. These languages can be used to model meaning representations in the formal semantics of natural languages following the tradition of Montague. Using techniques pertaining to the denotational semantics of the simply typed lambda-calculus, we show that the emptiness and membership problems for both types of grammars are decidable. In the course of the proof of the decidability results for OI, we identify a decidable variant of the lambda-definability problem, and prove a stronger form of Statman's finite completeness Theorem.
Liste complète des métadonnées

Cited literature [35 references]  Display  Hide  Download

https://hal.inria.fr/hal-00818069
Contributor : Sylvain Salvati <>
Submitted on : Thursday, April 25, 2013 - 11:48:47 PM
Last modification on : Thursday, January 11, 2018 - 6:20:16 AM
Document(s) archivé(s) le : Monday, April 3, 2017 - 11:53:19 PM

File

io_and_oi_revisited.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00818069, version 1

Citation

Gregory Kobele, Sylvain Salvati. The IO and OI hierarchies revisited. ICALP (2), Jul 2013, Riga, Latvia. ⟨hal-00818069⟩

Share

Metrics

Record views

274

Files downloads

238