A common approach to hiding implementation details is through the use of abstract types. In this paper, we present a simple theoretical account of abstract types that make use of a recently developed notion of conditional type equality. This is in contrast to most of the existing theoretical accounts of abstract types, which rely on existential types (or similar variants). In addition, we show that this new approach to abstract types opens a promising avenue to the design and implementation of module systems that can effectively support large-scale programming. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Xi, H. (2009). A simple and general theoretical account for abstract types. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5902 LNCS, pp. 336–349). https://doi.org/10.1007/978-3-642-10452-7_23
Mendeley helps you to discover research relevant for your work.