Polymorphic Type Inference and Abstract Data Types (1994)
| Venue: | ACM Transactions on Programming Languages and Systems |
| Citations: | 58 - 3 self |
BibTeX
@ARTICLE{Läufer94polymorphictype,
author = {Konstantin Läufer and Martin Odersky},
title = {Polymorphic Type Inference and Abstract Data Types},
journal = {ACM Transactions on Programming Languages and Systems},
year = {1994},
volume = {16}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Data Types Konstantin Läufer Martin Odersky Loyola University of Chicago Universität Karlsruhe laufer@math.luc.edu odersky@ira.uka.de June 5, 1994 Technical Report LUC-001 Abridged version appeared in Transactions of Programming Languages and Systems Abstract Many statically-typed programming languages provide an abstract data type construct, such as the module in Modula-2. However, in most of these languages, implementations of abstract data types are not first-class values. Thus they cannot be assigned to variables, passed as function parameters, or returned as function results. Several higher-order functional languages feature strong and static type systems, parametric polymorphism, algebraic data types, and explicit type variables. Most of them rely on Hindley -Milner type inference instead of requiring explicit type declarations for identifiers. Although some of these languages support abstract data types, it appears that none of them directly provides light-weight abstract dat...
