Abstract
So far we have only considered the simple data structuring operations of forming records with or without variants. Although these operations are adequate for many problems they are, by themselves, incapable of expressing clearly the full range of abstractions that can occur in programming.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1978 Derek Coleman
About this chapter
Cite this chapter
Coleman, D. (1978). Set Structures. In: A Structured Programming Approach to Data. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-15981-9_6
Download citation
DOI: https://doi.org/10.1007/978-1-349-15981-9_6
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-21943-0
Online ISBN: 978-1-349-15981-9
eBook Packages: Computer ScienceComputer Science (R0)