Magnus Kempe

Abstract data types are under full control with Ada 9X

Ada 83 did not provide enough control on the creation, assignment, and destruction of objects of user-defined types. This lack of control restricted type composition and prevented the full exercise of information hiding for abstract data types. Ada 9X brings new mechanisms supporting the full control of abstract data types, powerful type composition, and more extensive information hiding. With better control of abstract data types, Ada code will be easier to write, understand, maintain, and reuse. Thus, applications written in Ada 9X will be safer.

The composition of abstractions: evolution of software component design with Ada 95

Keywords: Ada Reference LGL-CONF-1995-017 Record created on 2005-09-20, modified on 2016-08-08

Heterogeneous Data Structures and Cross-Classification of Objects with Ada95

The implementation of ADTs for homogeneous data structures has become a classic example of ADT in Ada 83. With some effort, it was also possible to implement a restricted form of heterogeneous data structures, based on variant records. We show that various approaches in implementing flexible heterogeneous data structures with Ada 95 are now possible. One of these approaches is generalized to create heterogeneous catalogues of cross-referenced objects, thus implementing one kind of multiple classification.