The Qx-coder
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
This paper presents a treatment of pre- and post-conditions, and predicate transformers, in a category-theoretic setting. The meaning of a pair of pre- and post-conditions, or a predicate transformer, in a category is defined as a set of morphisms in that category. It is shown that this construction is natural in the sense that it forms part of a Galois connection. It is further proved that in the usual categories of interpretations (total functions, partial functions, and relations) pre- and post-conditions and predicate transformers have equal powers of specifications and we characterize the specifiable sets of morphisms in these categories. © 1987.
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
Thomas R. Puzak, A. Hartstein, et al.
CF 2007
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007
G. Ramalingam
Theoretical Computer Science