Abstract
Subsorts and supersorts are often useful in Casl specifications.
Many examples naturally involve subsorts and supersorts. Casl provides means for the declaration of a sort as a subsort of another one when the values of the subsort are regarded a special case of those in the other sort. The aim of this chapter is to discuss and illustrate how to handle subsorts and supersorts in Casl specifications.
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
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bidoit, M., Mosses, P.D. (2004). 5 Subsorting. In: Bidoit, M., Mosses, P.D. (eds) CASL User Manual. Lecture Notes in Computer Science, vol 2900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44397-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-44397-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20766-5
Online ISBN: 978-3-540-44397-1
eBook Packages: Springer Book Archive