Basic polymorphic typechecking
Science of Computer Programming
Understanding Z: a specification language and its formal semantics
Understanding Z: a specification language and its formal semantics
The Z notation: a reference manual
The Z notation: a reference manual
CADiZ : an architecture for Z tools and its implementation
Software—Practice & Experience
Should your specification language be typed
ACM Transactions on Programming Languages and Systems (TOPLAS)
Machine Support for Z: the zebB Tool
Proceedings of the Fifth Annual Z User Meeting on 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
Type-Constrained Generics for Z
ZB '00 Proceedings of the First International Conference of B and Z Users on Formal Specification and Development in Z and B
On Mutually Recursive Free Types in Z
ZB '00 Proceedings of the First International Conference of B and Z Users on Formal Specification and Development in Z and B
VDM '90 Proceedings of the Third International Symposium of VDM Europe on VDM and Z - Formal Methods in Software Development
Type Synthesis in B and the Translation of B to PVS
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
| Hi-index | 0.00 |
This paper presents some of our requirements for a Z typechecker: that the typechecker accept all well-typeable formulations, however contrived; that it gather information about uses of declarations as needed to support interactive browsing and formal reasoning; that it fit the description given by draft standard Z; and that it be able to check some particular extensions to Z that are intended to allow explicit definitions of schema calculus operators. The paper presents a specification of such a Z typechecker, which we have implemented.