Subtypes vs. Where Clauses: Constraining Parametric Polymorphism (1995) [70 citations — 11 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Mark Day and Robert Gruber and Barbara Liskov and Andrew C. Myers},
title = {Subtypes vs. Where Clauses: Constraining Parametric Polymorphism},
booktitle = {In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA},
year = {1995},
pages = {156--168}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
All object-oriented languages provide support for subtype polymorphism, which allows the writing of generic code that works for families of related types. There is also a need, however, to write code that is generic across types that have no real family relationship. To satisfy this need a programming language must provide a mechanism for parametric polymorphism, allowing for types as parameters to routines and types. We show that to support modular programming and separate compilation there must be a mechanism for constraining the actual parameters of the routine or type. We describe a simple and powerful constraint mechanism and compare it with constraint mechanisms in other languages in terms of both ease of use and semantic expressiveness. We also discuss the interaction between subtype and parametric polymorphism: we discuss the subtype relations that can exist between instantiations of parameterized types, and which of those relations are useful and can be implemented efficiently...
