The Z notation: a reference manual
The Z notation: a reference manual
Automating recursive type definitions in higher order logic
Current trends in hardware verification and automated theorem proving
The Z notation: a reference manual
The Z notation: a reference manual
Automating Induction over Mutually Recursive Functions
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
Proceedings of the Z User Workshop
Proceedings of the Z User Workshop
Innovations in the Notation of Standard Z
ZUM '98 Proceedings of the 11th International Conference of Z Users on The Z Formal Specification Notation
Inconsistency and Undefinedness in Z - A Practical Guide
ZUM '98 Proceedings of the 11th International Conference of Z Users on The Z Formal Specification Notation
ZUM '98 Proceedings of the 11th International Conference of Z Users on The Z Formal Specification Notation
A tactic language for reasoning about Z specifications
3FACS'98 Proceedings of the 3rd BCS-FACS conference on Northern Formal Methods
ZB '00 Proceedings of the First International Conference of B and Z Users on Formal Specification and Development in Z and B
Closure Induction in a Z-Like Language
ZB '00 Proceedings of the First International Conference of B and Z Users on Formal Specification and Development in Z and B
Characters + Mark-up = Z Lexis
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
| Hi-index | 0.00 |
Mutually recursive free types are one of the innovations in the forthcoming ISO Standard for the Z notation. Their semantics has been specified by extending a formalization of the semantics of traditional Z free types to permit mutual recursion. That development is reflected in the structure of this paper. An explanation of traditional Z free types is given, along with some examples, and their general form is defined. Their semantics is defined by transformation to other equivalent Z notation. These equivalent constraints provide a basis for inference rules, as illustrated by an example proof. Notation for mutually recursive free types is introduced, and the semantics presented earlier is extended to define their meaning. Example inductive proofs concerning mutually recursive free types are presented.