Abstract
User-defined types (or modes) and procedural (or functional) data structures are complementary methods for data abstraction, each providing a capability lacked by the other. With user-defined types, all information about the representation of a particular kind of data is centralized in a type definition and hidden from the rest of the program. With procedural data structures, each part of the program which creates data can specify its own representation, independently of any representations used elsewhere for the same kind of data. However, this decentralization of the description of data is achieved at the cost of prohibiting primitive operations from accessing the representations of more than one data item. The contrast between these approaches is illustrated by a simple example.
Work supported by National Science Foundation Grant GJ-41540.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag New York Inc
About this chapter
Cite this chapter
Reynolds, J.C. (1978). User-Defined Types and Procedural Data Structures as Complementary Approaches to Data Abstraction. In: Gries, D. (eds) Programming Methodology. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-6315-9_22
Download citation
DOI: https://doi.org/10.1007/978-1-4612-6315-9_22
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6317-3
Online ISBN: 978-1-4612-6315-9
eBook Packages: Springer Book Archive