Abstract

ion in Object-Oriented Languages S. Yu and Q. Zhuang Department of Computer Science, The University of Western Ontario London, Ontario, Canada N6A 5B7 E-mail: syu@csd.uwo.ca Abstract The abstraction gap between algorithms and procedures causes numerous duplicate efforts in implementing the same algorithms as well as apparent under-use of many efficient algorithms. A solution to this problem is to realize algorithmic abstraction at the programming language level in addition to data abstraction. In this paper, we first discuss the two conditions for a programming language to support algorithmic abstraction. We introduce a type system, which consists of entities from a four-level hierarchy: objects, classes, types, and kinds. We also introduce a new form of parametric polymorphism, called kind-bounded parametric polymorphism, which is a generalization of universal and inclusion-bounded parametric polymorphisms. Then we describe the KC programming language which we have designed and im...

Citations