Abstract
In chapter 2 it became apparent that newly introduced object sets never occur “isolated” but always together with operations characteristic of them. Thus the canonical operations termed constructors and selectors belong to composite objects (comp. 2.5 and 2.6); the comparison operator is invariably available for all object sets (comp. 2.4). In chapter 1 we have pragmatically presupposed certain object sets such as bool, nat, int, sequ χ etc. and their characteristic operations.
“If at a given level of refinement one is interested only in the behavioural characteristics of certain data objects, then any attempt to abstract data must be based upon those characteristics, and only those characteristics. The introduction of attributes, e. g. a representation, can only serve to cloud the relevant issues!”
Guttag 1975
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bauer, F.L., Wössner, H., Partsch, H., Pepper, P. (1982). Computational Structures. In: Algorithmic Language and Program Development. Texts and Monographs in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61807-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-61807-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-61809-3
Online ISBN: 978-3-642-61807-9
eBook Packages: Springer Book Archive