English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Structural decidable extensions of bounded quantification

Vorobyov, S. (1995). Structural decidable extensions of bounded quantification. In Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL'95) (pp. 164-175). New York, USA: ACM.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Vorobyov, Sergei1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: We show how the subtype relation of the well-known system Fsub, the second-order polymorphic lambda-calculus with bounded universal type quantification and subtyping, due to Cardelli, Wegner, Bruce, Longo, Curien, Ghelli, proved undecidable by Pierce (POPL'92), can be interpreted in the (weak) monadic second-order theory of one (B\"uchi), two (Rabin), several, or infinitely many successor functions. These (W)SnS-interpretations show that the undecidable system Fsub possesses consistent decidable extensions, i.e., Fsub is not essentially undecidable (Tarski, 1949). \par We demonstrate an infinite class of structural decidable extensions of Fsub, which combine traditional subtype inference rules with the above (W)SnS-interpretations. All these extensions, which we call systems FsubSnS, are still more powerful than Fsub, but less coarse than the direct (W)SnS-interpretations. \par The main distinctive features of the systems FsubSnS are: 1) decidability, 2) closure w.r.t.\ transitivity; 3) structuredness, e.g., they never subtype a functional type to a universal one or vice versa, 4) they all contain the powerful rule for subtyping boundedly quantified types.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-121995
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 519472
Other: Local-ID: C1256104005ECAFC-13024CD88AA109D4C1256144006240D9-Vorobyov94h
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: San Francisco, USA
Start-/End Date: 1995

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL'95)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, USA : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 164 - 175 Identifier: -