On a uniform formal description of data structures

The paper gives a semantic for data structures defining a model in which both types and objects are based on certain right-linear grammars. The advantage of the proposed semantic is the uniformity with which the selecting and accessing operations are explained respectively. The distinction between accessing variables or constants is consistently based on a property of the corresponding selectors. Usual difficulties in distinguishing between constant and variable objects in programming languages can thus be avoided. Another advantage is that selective assignments to components of structures are contained in the model in a very natural way.

[1]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[2]  B. J. Mailloux,et al.  Report of Algorithmic Language ALGOL 68 , 1969 .

[3]  E. Engeler Symposium on Semantics of Algorithmic Languages , 1971, Symposium on Semantics of Algorithmic Languages.

[4]  Kurt Walk,et al.  Formalization of Storage Properties , 1971, Programming Languages and Their Definition.