Abstract
This paper considers some issues in the theory and practice of defining functions over recursive data types in Z. Principles justifying such definitions are formulated. Z free types are contrasted with the free algebras of universal algebra: the notions turn out to be related but not isomorphic.
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.
References
Arthan, R.D.: On Free Type Definitions in Z. In: Nicholls, J.E. (ed.) Z User Workshop, York. Workshops in Computing, pp. 40–58. Springer, Heidelberg (1992)
Arthan, R.D.: Recursive Data Types in Typed Set Theory. Unpublished pre-print (1997)
Arthan, R.D.: Mechanizing the Z Toolkit. In: Mislova, M. (ed.) Proceedings of the Oxford Workshop on Automated Formal Methods. Elsevier Electronics Notes in Computer Science (1998) (to appear)
Cohn, P.M.: Universal Algebra. D. Reidel Publishing Company (1981)
Halmos, P.R.: Naive Set Theory. Springer, Heidelberg (1974)
Melham, T.F.: Automating Recursive Type Definitions in Higher Order Logic. In: Birtwistle, G., Subrahmanyam, P.A. (eds.) Current Trends in Hardware Verification and Automated Theorem Proving. Springer, Heidelberg (1989)
Smith, A.: On Recursive Free Type In Z. Rsre Memorandum 91028. MOD PE, RSRE, UK (1991)
Spivey, J.M.: The Z Notation: A Reference Manual. Prentice Hall International Series in Computer Science (1989)
Spivey, J.M.: The Z Notation: A Reference Manual, 2nd edn. Prentice Hall International Series in Computer Science (1992)
Spivey, J.M.: Richer Types for Z. Formal Aspects of Computing 8(5), 565–584 (1996)
Spivey, J.M.: The Consistency Theorem for Free Type Definitions in Z (Short Communication). Formal Aspects of Computing 8(3), 369–376 (1996)
Valentine, S.: Inconsistency and undefinedness in Z - A practical guide. In: Bowen, J.P., Fett, A., Hinchey, M.G. (eds.) ZUM 1998. LNCS, vol. 1493, pp. 233–250. Springer, Heidelberg (1998)
Woodcock, J.C.P., Davies, J.: Using Z: Specification, Refinement and Proof. Prentice Hall International Series in Computer Science (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arthan, R.D. (1998). Recursive Definitions in Z. In: Bowen, J.P., Fett, A., Hinchey, M.G. (eds) ZUM ’98: The Z Formal Specification Notation. ZUM 1998. Lecture Notes in Computer Science, vol 1493. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49676-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-49676-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65070-6
Online ISBN: 978-3-540-49676-2
eBook Packages: Springer Book Archive