Abstract
Every data type defines a set of values. In the case of a set type S, this set of values is the set of all possible sets consisting of elements from a given base type B. For example, if the base type B is the subrange \({\rm{B = }}\left[ {{\rm{0}}..{\rm{1}}} \right]\) and the set type S is declared as \({\rm{S = SET OF B}}\) then the values of type S are the sets {}, {0}, {1}, {0,1}. If the base type has n distinct values, then its set type has 2 to the power of n values. {} denotes the empty set.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wirth, N. (1985). Set types. In: Programming in Modula-2. Texts and Monographs in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-96878-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-96878-5_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-96880-8
Online ISBN: 978-3-642-96878-5
eBook Packages: Springer Book Archive