Abstract
Imperative programs work by making successive changes to a state. In the introduction we assumed that an agent has available a collection of functions that it can apply to a state in order to change the state in some desired way. By composing such state functions we can describe more complicated state changes. This gives us a first, very simple model of programs, where a program is seen as a total function from a set of initial states to a set of final states.
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
Preview
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). States and State Transformers. In: Refinement Calculus. Graduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1674-2_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1674-2_5
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