The IO and OI hierarchies revisited - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information and Computation Année : 2015

The IO and OI hierarchies revisited

Résumé

We study languages of λ-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 [25]. Using techniques pertaining to the denotational semantics of the simply typed λ-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 λ-definability problem, and prove a stronger form of Statman's finite completeness Theorem [35].
Fichier principal
Vignette du fichier
io_and_oi_revisited.pdf (437.91 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01251097 , version 1 (05-01-2016)

Identifiants

Citer

Gregory M. Kobele, Sylvain Salvati. The IO and OI hierarchies revisited. Information and Computation, 2015, 243, pp.205-221. ⟨10.1016/j.ic.2014.12.015⟩. ⟨hal-01251097⟩
125 Consultations
190 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More