By Topic

Objects and Values: The Basis of a Storage Model for Procedural Languages

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
D. B. Lomet ; University of Newcastle upon Tyne, UK

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.  

Published in:

IBM Journal of Research and Development  (Volume:20 ,  Issue: 2 )