Algebraic structures for program calculation

In calculational program design one derives implementations from specifications using semantics-preserving deduction rules. The aim of modern algebraic approaches is to make both specification and calculation more concise and perspicuous by compacting logic into algebra as much as possible. We present a collection of algebraic calculi that are useful in this activity. They are shown at work in a number of examples that range from graph algorithms over stream processing to hardware description