On the Decidability of Subtyping with Bounded Existential Types and Implementation Constraints

Abstract Bounded existential types are a powerful language feature for modeling partial data abstraction and information hiding. However, existentials do not mingle well with subtyping as found in current object-oriented languages: the subtyping relation is already undecidable for very restrictive s...
Ausführliche Beschreibung

Gespeichert in:
Autor*in:

Wehr, Stefan [verfasserIn]

Thiemann, Peter

Format:

E-Artikel

Sprache:

Englisch

Erschienen:

2011

Schlagwörter:

Object-Oriented Programming

Subtyping

Bounded Existential Types

Undecidability

Anmerkung:

© Ohmsha and Springer Japan jointly hold copyright of the journal. 2011

Übergeordnetes Werk:

Enthalten in: New generation computing - Tokyo [u.a.] : Ohmsha, 1983, 29(2011), 1 vom: Jan., Seite 87-124

Übergeordnetes Werk:

volume:29 ; year:2011 ; number:1 ; month:01 ; pages:87-124

Links:

Volltext

DOI / URN:

10.1007/s00354-010-0100-1

Katalog-ID:

SPR004434676

Nicht das Richtige dabei?

Schreiben Sie uns!