Rationale for the Design of Reusable Abstract Data Types implemented in Ada
1989
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.
Details
Title
Rationale for the Design of Reusable Abstract Data Types implemented in Ada
Author(s)
Genillard, Christian ; Ebel, Norbert ; Strohmeier, Alfred
Published in
AdaLetters
Volume
9
Issue
2
Pages
62-71
Date
1989
Keywords
Laboratories
LGL
Record Appears in
Scientific production and competences > I&C - School of Computer and Communication Sciences > IC Archives > LGL - Software Engineering Laboratory
Conference Papers
Work produced at EPFL
Published
Conference Papers
Work produced at EPFL
Published
Record creation date
2005-09-20