Abstract
In this paper we outline a framework for data structures in the spirit of the Vienna Definition Language but extended to the most general class of objects, namely arbitrary directed rooted graphs in which the information associated with each node is either empty, elementary or an object in the general class. Since many data structures cannot be modelled by tree structures in a natural way, such a generalisation to graphs is desirable. Furthermore, the concept of hierarchy in which a node may serve for an arbitrary complex substructure supports a structured view of complex data objects.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.A. GOGUEN, J.W. THATCHER, E.G. WAGNER: An initial algebra approach to the specification, correctness and implementation of abstract data types, in R.T. Yeh (ed.) Current trends in programming methodology. IV, Data structuring, Prentice Hall, Englewood Cliffs, New Jersey, (1978)
J.A. Bergstra, H.J.M. Goeman, A. Ollongren, G.A. Terpstra, Th.P. van der Weide: Axions for multilevel objects, submitted for publication in Fundamenta Informaticae (1978)
H.-D. Ehrich: Ein axiomatischer Ansatz für eine Algebra strukturierter Objekte, Bericht 5/74, Abteilung. Informatik, Universität Dortmund (1974)
H.-D. Ehrich: Outline of an algebraic theory of structured objects, Automata, Languages and Programming, Third Intern. Colloquium, Edinburgh University Press (1976)
H. Goeb: Semantische Beschreibung listenverarbeitender Algorithmen durch eine Verallgemeinerung der Wiener Definitionssprache, Arbeitsbericht Band 7, Nol, Institut f. Math. Maschinen und Datenverarbeitung, Universität Erlangen (1974)
S. Kamin: Some definitions for algebraic data type specifications, SIGPLAN Notices 14(3) (1979) 28–37.
D. Kapur: Specifications of Majster's Traversable Stack and Veloso's Traversable Stack, SIGPLAN Notices 14(5) (1979) 46–53.
P. Lucas, P. Lauer, H. Stigleitner: Method and notation for the formal definition of programming languages, Techn. Report TR 25.087, IBM Lab. Vienna (1968) revised 1970
M.E. Majster: Limits of the "algebraic" specification of abstract data types, SIGPLAN Notices 12 (10) (1977) 37–42.
J. Mühlbacher: Datenstrukturen,Carl Hanser Verlag, München-Wien (1975)
A. Ollongren: A theory for the objects of the Vienna Definition Language, Techn Report TR 25.123, IBM Lab. Vienna (1971)
A. Ollongren: Multilevel arrays as datatypes, Bericht 91/1979, Abteilung Informatik, Universität Dortmund (1979)
T.W. Pratt: A hierarchical graph model of the semantics of programs, Proceedings AFIPS SJCC (1969) 813–825
A.L. Rosenberg, J.W. Thatcher: What is a multilevel array, IBM Journal of Research and Development, Vol 19 (1975) 163–169
B. Shneiderman, P. Scheuermann: Structured data structures, Comm.ACM 17, 10 (1974) 566–574
H.W. Six: Ein Modell zur Beschreibung von Datenstrukturen und deren Realisationen, Dissertation, Universität Karlsruhe (1978)
T. Standish: Data structures-an axiomatic approach, Techn. Report 2639, Bolt Beranek and Newman, Inc., Cambridge, Mass. (1973)
K. Walk, K. Alber, M. Fleck, H. Goldmann, E. Moser, P. Oliva, H. Stigleitner, G. Zeisel: Abstract syntax and interpretation of PL/1, Techn Report TR 25.098, IBM Lab. Vienna (1969)
P. Wegner: The Vienna Definition Language, ACM Computing Surveys 4(1) (1972) 5–63
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Six, H.W. (1981). A framework for data structures. In: Noltemeier, H. (eds) Graphtheoretic Concepts in Computer Science. WG 1980. Lecture Notes in Computer Science, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10291-4_17
Download citation
DOI: https://doi.org/10.1007/3-540-10291-4_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10291-5
Online ISBN: 978-3-540-38435-9
eBook Packages: Springer Book Archive