A library of generic algorithms in Ada
- 1 January 1987
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 216-225
- https://doi.org/10.1145/317500.317529
Abstract
It is well-known that data abstractions are crucial to good software engineering practice. We argue that algorithmic abstractions, or generic algorithms, are perhaps even more important for software reusability. Generic algorithms are parameterized procedural schemata that are completely independent of the underlying data representation and are derived from concrete, efficient algorithms. We discuss this notion with illustrations from the structure of an Ada library of reusable software components we are presently developing.Keywords
This publication has 0 references indexed in Scilit: