MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Proceedings Article, Paper


@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Vorobyov, Sergeidblp
Editor(s):
BibTeX cite key*:
Vorobyov94h
Title, Booktitle
Title*:
Structural decidable extensions of bounded quantification
Booktitle*:
Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL'95)
Event, URLs
Conference URL::
Downloading URL:
Event Address*:
San Francisco, USA
Language:
English
Event Date*
(no longer used):
January 22-25, 1995
Organization:
Event Start Date:
21 May 2024
Event End Date:
21 May 2024
Publisher
Name*:
ACM
URL:
Address*:
New York, USA
Type:
Technical Report
Vol, No, Year, pp.
Series:
Volume:
Number:
Month:
January
Pages:
164-175
Year*:
1995
VG Wort Pages:
ISBN/ISSN:
Sequence Number:
DOI:
Note, Abstract, ©
Note:
Also available as Research Report MPI-I-94-257, Max-Planck-Institut für Informatik, Saarbrücken, Germany
(LaTeX) 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.
Download
Access Level:

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Programming Logics Group
Audience:
experts only
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat



BibTeX Entry:
@INPROCEEDINGS{Vorobyov94h,
AUTHOR = {Vorobyov, Sergei},
 TITLE = {Structural decidable extensions of bounded quantification},
 BOOKTITLE = {Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL'95)},
 PUBLISHER = {ACM},
 YEAR = {1995},
 TYPE = {Technical Report},
 INSTITUTION = {Max-Planck-Institut für Informatik},
 PAGES = {164--175},
 ADDRESS = {San Francisco, USA},
 MONTH = {January},
}

Entry last modified by Christine Kiesel, 03/12/2010
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Uwe Brahm		Created
01/14/1995 06:53:11 PM
Revisions
23.
22.
21.
20.
19.		Editor(s)
Christine Kiesel
Christine Kiesel
Uwe Brahm/MPII/DE
Christine Kiesel/AG2/MPII/DE
Christine Kiesel/AG2/MPII/DE		Edit Dates
30.08.2001 09:57:53
28.08.2001 14:26:56
20.03.96 17:00:54
01/03/96 14:29:50
26/02/96 05:12:18