Skip to main content

On a uniform formal description of data structures

  • Conference paper
  • First Online:
Book cover Mathematical Studies of Information Processing

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 75))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. van Wijngaarden, A. (ed.); Mailloux, B.J.; Peck, J.E.L.; Koster, C.H.A.: Report on the Algorithmic Language ALGOL 68. Num. Math. 14, 79–218 (1969)

    Google Scholar 

  2. Bekić, H.; Walk, K.: Formalization of Storage Properties. In: Symposium on semantics of algorithmic languages (E. Engeler, ed.), Lecture Notes in Mathematics, Vol. 188, p. 28–61. Berlin-Heidelberg-New York: Springer 1971

    Google Scholar 

  3. Jensen, K.; Wirth, N.: PASCAL. User Manual and Report, 2nd ed.. Berlin-Heidelberg-New York: Springer 1975

    Google Scholar 

  4. Dijkstra, E.W.: A Discipline of Programming. Englewood Cliffs: Prentice Hall 1976

    Google Scholar 

  5. Bauer, F.L.: Algorithmische Sprachen. Kap. 4–7, Vorlesungsskriptum Techische Universität München, Institut für Informatik, Februar 1978

    Google Scholar 

Download references

Authors

Editor information

E. K. Blum M. Paul S. Takasu

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Paul, M., Güntzer, U. (1979). On a uniform formal description of data structures. In: Blum, E.K., Paul, M., Takasu, S. (eds) Mathematical Studies of Information Processing. Lecture Notes in Computer Science, vol 75. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09541-1_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-09541-1_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09541-5

  • Online ISBN: 978-3-540-35010-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics