Mathematics of Program Construction, Vol. 142 Book

	On the Aesthetics of Diagrams	1
	Generalising monads	6
	A proof rule for control loops	7
	Relation-algebraic derivation of spanning tree algorithms	23
	An application of program derivation techniques to 18th-century mathematics	44
	Nested datatypes	52
	An approach to object-orientation in action systems	68
	Layered graph traversals and Hamiltonian path problems - An algebraic approach	96
	A unifying framework for correct program construction	122
	Computation calculus - Bridging a formalization gap	151
	An elementary derivation of the alternating bit protocol	175
	A set-theoretic model for real-time specification and reasoning	188
	Polytypic downwards accumulations	207
	Formal derivation of a loadable asynchronous counter	234
	A semantic approach to secure information flow	254
	Slack elasticity in concurrent computing	272
	Beyond Fun: Order and membership in polytypic imperative programming	286
	Convergence of program transformers in the metric space of trees	315
	Realizability of monotone coinductive definitions and its application to program synthesis	338
	Calculating a round-robin scheduler	365
	Author Index	383