Abstract
A procedure in SETL is a sequence of computational steps which have been given a name and which, using one or more data items passed to it for processing, will compute and deliver a value. Most of the built-in SETL operators, for example max, which returns the maximum of two values x and y, and cos, which returns the cosine of a floating-point number x passed to it, are procedures in this sense. However, since no finite collection will ever exhaust the whole catalog of procedures that a programmer may want to use, it is important to have a way of defining, and then using, as many additional operations as are helpful.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). Procedures. In: Programming with Sets. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9575-1_5
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9575-1_5
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