In this paper we demonstrate that the basic rules and calculational techniques used in two extensively documented program derivation methods can be expressed, and, indeed, can be generalised within a relational theory of datatypes. The two methods to which we refer are the so-called “Bird-Meertens formalism” (see [22]) and the “Dijkstra-Feijen calculus” (see [15]). The current paper forms an abridged, though representative, version of a complete account of the algebraic properties of the Boom hierarchy of types [19, 18]. Missing is an account of extensionality and the so-called cross-product.
CITATION STYLE
Hoogendijk, P. F. (1993). (Relational) programming laws in the boom hierarchy of types. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 669 LNCS, pp. 163–190). Springer Verlag. https://doi.org/10.1007/3-540-56625-2_13
Mendeley helps you to discover research relevant for your work.