Abstract
Sets in SETL are finite collections of arbitrary SETL values. These values, called the members (or elements) of the set, are themselves data items of any SETL type. To write a set denotation, we simply list the members of the set, with commas between successive members, within the set brackets “{” and “}”.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
© 1986 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Schwartz, J.T., Dewar, R.B.K., Schonberg, E., Dubinsky, E. (1986). Compound Data Types and Operators. In: Programming with Sets. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9575-1_3
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9575-1_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9577-5
Online ISBN: 978-1-4613-9575-1
eBook Packages: Springer Book Archive