Mathematics of Program Construction: 4th International Conference, MPC'98, Marstrand, Sweden, June 15-17, 1998, Proceedings

On the aesthetics of diagrams.- Generalising monads.- A proof rule for control loops.- Relation-algebraic derivation of spanning tree algorithms.- An application of program derivation techniques to 18th-century mathematics.- Nested datatypes.- An approach to object-orientation in action systems.- Layered graph traversals and Hamiltonian path problems - An algebraic approach.- A unifying framework for correct program construction.- Computation calculus bridging a formalization gap.- An elementary derivation of the alternating bit protocol.- A set-theoretic model for real-time specification and reasoning.- Polytypic downwards accumulations.- Formal derivation of a loadable asynchronous counter.- A semantic approach to secure information flow.- Slack elasticity in concurrent computing.- Beyond Order and membership in polytypic imperative programming.- Convergence of program transformers in the metric space of trees.- Realizability of monotone coinductive definitions and its application to program synthesis.- Calculating a round-robin scheduler.