Software reuse via algorithmic abstraction
Conference
·
OSTI ID:210056
- Univ. of Western Ontario, London (Canada)
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. Then we describe the KC programming language, which we have designed and implemented to realize the above ideas. We predict that the introduction of algorithmic abstraction into object-oriented languages will greatly increase the reusability as well as the reliability of software.
- OSTI ID:
- 210056
- Report Number(s):
- CONF-950773--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Reusing and interconnecting software components
Software Synthesis for High Productivity Exascale Computing
RIPE: A Robot Independent Programming Environment
Journal Article
·
Fri Jan 31 23:00:00 EST 1986
· Computer; (United States)
·
OSTI ID:5787772
Software Synthesis for High Productivity Exascale Computing
Technical Report
·
Wed Sep 01 00:00:00 EDT 2010
·
OSTI ID:1214546
RIPE: A Robot Independent Programming Environment
Conference
·
Wed Oct 31 23:00:00 EST 1990
·
OSTI ID:714956