Please use this identifier to cite or link to this item: doi:10.22028/D291-25672
Title: Generativity and dynamic opacity for abstract types
Author(s): Rossberg, Andreas
Language: English
Year of Publication: 2003
OPUS Source: Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, Upsalla, Sweden, 27-29 August 2003, pp. 241-252
Free key words: Abstract Types
DDC notations: 004 Computer science, internet
Publikation type: Conference Paper
Abstract: The standard formalism for explaining abstract types is existential quantification. While it provides a sufficient model for type abstraction in entirely statically typed languages, it proves to be too weak for languages enriched with forms of dynamic typing, where parametricity is violated. As an alternative approach to type abstraction that addresses this shortcoming we present a calculus for dynamic type generation. It features an explicit construct for generating new type names and relies on coercions for managing abstraction boundaries between generated types and their designated representation. Sealing is represented as a generalized form of these coercions. The calculus maintains abstractions dynamically without restricting type analysis.
Link to this record: urn:nbn:de:bsz:291-scidok-2742
Date of registration: 25-Jun-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 
generativity.pdf165 kBAdobe PDFView/Open

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