Abstract
In this chapter an object-like character is conceded to program variables: for example they can occur as components of a composition (“organized storages”). Topics discussed are consequences of this such as the “generation” of variables, peculiarities with regard to identity as well as the possibilities of implementing recursively defined object structures by means of organized storages. Forming nexuses (2.14) of variables leads — after transition to another semantic model — to the introduction of pointers and the formation of linked lists. Finally we will discuss the transition to the addresses. These terms lead to a borderline across which the domain of machine-oriented (system) programming expands. For further information see e. g. Graham 1975. Here we are trying to show primarily that it is not necessary to start the discussion with a particular machine organization.
“Machine language coding is … the original dark craft from which we try to abstract ourselves, but into which we all lapse from time to time.”
Turski 1978
“Von Neumann languages constantly keep our noses pressed in the dirt of address computation of single words.”
Backus 1978a
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bauer, F.L., Wössner, H., Partsch, H., Pepper, P. (1982). Organized Storages and Linked List. In: Algorithmic Language and Program Development. Texts and Monographs in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61807-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-61807-9_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-61809-3
Online ISBN: 978-3-642-61807-9
eBook Packages: Springer Book Archive