Abstract
A rigorous treatment of types as sets is given for the refinement calculus, a method of imperative program development. It is simple, supports existing practice, casts new light on type-checking, and suggests generalisations that might be of practical benefit. Its use is illustrated by example.
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.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Carroll Morgan and Trevor Vickers
About this chapter
Cite this chapter
Morgan, C., Vickers, T. (1992). Types and Invariants in the Refinement Calculus. In: Morgan, C., Vickers, T. (eds) On the Refinement Calculus. Formal Approaches to Computing and Information Technology (FACIT). Springer, London. https://doi.org/10.1007/978-1-4471-3273-8_9
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3273-8_9
Publisher Name: Springer, London
Print ISBN: 978-3-540-19931-1
Online ISBN: 978-1-4471-3273-8
eBook Packages: Springer Book Archive