Abstract
The design (as opposed to the choice and use) of data structures has been the subject of relatively little study in the context of formal methods. In this paper, we introduce our ideas on how data structures are designed.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Mary E. d’Imperio, Data Structures and their Representation in Storage, in Halpern, Shaw (editors), Annual Review in Automatic Programming, Volume 5, pp. 1–76, International Tracts in Computer Science and Technology and Their Applications, Pergamon Press Ltd., 1969.
Muffy H. Thomas, Implementing Algebraically Specified Abstract Data Types in an Imperative Programming Language, in TAPSOFT ‘87, Pisa, Italy, Lecture Notes in Computer Science, Volume 250, Springer Verlag, 1987.
Muffy H. Thomas, The Imperative Implementation of Algebraic Data Types, Research Report CSC/88/R4, Computing Science Department, University of Glasgow, 1987 (also, Ph.D. thesis, University of St. Andrews, 1987.)
Richard J. Bird and Philip Wadler, An introduction to Functional Programming, Prentice-Hall, 1988.
Aho, Hoperoft, Ullman, The Design and Analysis of Computer Algorithms, Addison Wesley, 1974.
Donald Erwin Knuth, The Art Of Computer Programming, Volume 3, Sorting and Searching, Addison Wesley, 1973.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 British Computer Society
About this paper
Cite this paper
Reid, A. (1990). Designing Data Structures. In: Davis, K., Hughes, J. (eds) Functional Programming. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3166-3_12
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3166-3_12
Publisher Name: Springer, London
Print ISBN: 978-3-540-19609-9
Online ISBN: 978-1-4471-3166-3
eBook Packages: Springer Book Archive