Conference paper

Rationale for the Design of Reusable Abstract Data Types implemented in Ada

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.

    Keywords: Ada


    • LGL-CONF-1989-001

    Record created on 2005-09-20, modified on 2016-08-08


  • There is no available fulltext. Please contact the lab or the authors.

Related material