Rational for the design of reusable abstract data types implemented in Ada

Authors:
C. Genillard;N. Ebel;A. Strohmeler
Affiliations:
Swiss Federal Institute of Technology, Department of Computer Science, CH-1015 Lausanne, Switzerland;Swiss Federal Institute of Technology, Department of Computer Science, CH-1015 Lausanne, Switzerland;Swiss Federal Institute of Technology, Department of Computer Science, CH-1015 Lausanne, Switzerland
Venue:
ACM SIGAda Ada Letters
Year:
1989

Citing 4
Cited 5

Software engineering with Ada

Software engineering with Ada
Storage reclamation models for Ada programs

SIGAda '87 Proceedings of the 1987 annual ACM SIGAda international conference on Ada
Measurable characteristics of reusable Ada software

ACM SIGAda Ada Letters
Software Component with ADA

Software Component with ADA

The form of reusable Ada components for concurrent use

ACM SIGAda Ada Letters
Object-oriented programming in Ada83—genericity rehabilitated

ACM SIGAda Ada Letters
Abstract data types are under full control with Ada 9X

TRI-Ada '94 Proceedings of the conference on TRI-Ada '94
Functional lists: object-oriented design classes for MIS applications

WADAS '90 Proceedings of the seventh Washington Ada symposium on Ada
Software reuse guidelines

ACM SIGSOFT Software Engineering Notes

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reusable abstract data types may be implemented in Ada as generic packages. First we will state some design goals, then outline our solution, address its rationale and show why alternatives have to be rejected. The presented design rules have already been applied successfully for implementing a rather wide set of abstract data types.