Skip to Main Content
A model for storage in procedural languages is presented. Its fundamental notion is to strictly distinguish values from storage objects. Several difficulties in current languages are resolved in this model, e. g., the problem of flexible locations and the meaning of the term type. In the light of the storage object/value dichotomy, several notions are found to be covered by the term type. The implications of the model are explored with respect to the more conventional data constructs of procedural languages as well as to sets and how they might be provided. Finally, data extension mechanisms are considered. Whereas the treatment here is not complete, the template concept introduced in the model does suggest a useful framework for providing the much talked of but seldom realized benefits of data extensibility.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.