Abstract#R##N##R##N#In this paper a new model is presented for the run-time description of arrays, records, and other data types in Ada*-like programming languanges. The model has several advantages over the classical implementation model using dope vectors. It has been used for the run-time description of data strutures in an implementation of almost the whole Ada programming languange.#R##N##R##N##R##N##R##N#First an outline of our data description model is presented, then issues in addressing components of composite objects are discussed. A practical approach to implement the model is discussed next and finally an example is given and some conclusions are drawn.
['J. van Katwijk']
Addressing types and objects in Ada