Abstract
The recursive constructs provide powerful programming tools. In the general case, the body S of a recursion (µ X • S) or (v X • S) can be an arbitrary term of predicate transformer type. An important special case of recursion is iteration, i.e., the repeated execution of a statement. In this chapter we consider different kinds of iterations.
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
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Back, RJ., von Wright, J. (1998). Iteration and Loops. In: Refinement Calculus. Graduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1674-2_21
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1674-2_21
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-98417-9
Online ISBN: 978-1-4612-1674-2
eBook Packages: Springer Book Archive