A library of generic algorithms in Ada

Authors:
David R. Musser;Alexander A. Stepanov
Affiliations:
General Electric Company, Corporate Research & Development, P. 0. Box 8, Schenectady, New York;Polytechnic University, Computer Science Department, 333 Jay Street, Brooklyn, New York
Venue:
SIGAda '87 Proceedings of the 1987 annual ACM SIGAda international conference on Ada
Year:
1987

Citing 5
Cited 8

Common LISP: the language

Common LISP: the language
Algorithms

Algorithms
The Art of Computer Programming Volumes 1-3 Boxed Set

The Art of Computer Programming Volumes 1-3 Boxed Set
Algorithms + Data Structures = Programs

Algorithms + Data Structures = Programs
Software Tools in Pascal

Software Tools in Pascal

Concept-Based Component Libraries and Optimizing Compilers

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Requirement Oriented Programming

Selected Papers from the International Seminar on Generic Programming
Essential language support for generic programming

Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Object-oriented algorithm analysis and design with Java

Science of Computer Programming - Special issue on principles and practice of programming in java (PPPJ 2003)
Concepts: linguistic support for generic programming in C++

Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
A language for generic programming in the large

Science of Computer Programming
Language requirements for large-scale generic libraries

GPCE'05 Proceedings of the 4th international conference on Generative Programming and Component Engineering
The c++0x "concepts" effort

SSGIP'10 Proceedings of the 2010 international spring school conference on Generic and Indexed Programming

Quantified Score

Hi-index	0.00

Visualization

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.