The IO and OI hierarchies revisited - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

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.
Fichier principal
Vignette du fichier
io_and_oi_revisited.pdf (369.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00818069 , version 1 (25-04-2013)

Identifiers

  • HAL Id : hal-00818069 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More