Rational for the design of reusable abstract data types implemented in Ada
C Genillard, N Ebel, A Strohmeler - ACM SIGAda Ada Letters, 1989 - dl.acm.org
C Genillard, N Ebel, A Strohmeler
ACM SIGAda Ada Letters, 1989•dl.acm.orgReusable 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.
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.
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.
ACM Digital Library