Abstract
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 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.
Cite
CITATION STYLE
Toyn, I., Valentine, S. H., Stepney, S., & King, S. (2000). Typechecking Z. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1878, pp. 264–285). Springer Verlag. https://doi.org/10.1007/3-540-44525-0_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
