Please use this identifier to cite or link to this item: doi:10.22028/D291-25774
Title: Dynamic opacity for abstract types
Author(s): Rossberg, Andreas
Language: English
Year of Publication: 2002
SWD key words: Typisierter Lambda-Kalkül
Free key words: Kalkül für polymorphe Sprachen
Abstract Types
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: Existential types are the standard formalisation of abstract types. While this formulation is sufficient in entirely statically typed languages, it proves to be too weak for languages enriched with forms of dynamic typing: in the presence of operations performing type analysis, the abstraction barrier erected by the static typing rules for existential types is no longer impassable, because parametricity is violated. We present a light-weight calculus for polymorphic languages with abstract types that addresses this shortcoming. It features a variation of existential types that retains most of the simplicity of standard existentials. It relies on modified scoping rules and explicit coercions between the quantified variable and its witness type.
Link to this record: urn:nbn:de:bsz:291-scidok-2925
Date of registration: 12-Jul-2004
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
opaque.pdf197,89 kBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.