"We prove two transformation rules over popular primitives of parallel programming: the first rule transforms a sequential composition of scan and reduction into a single reduction, the second rule transforms a composition of two scans into a single scan. For the maximum segment sum problem, we formally derive the two previously known parallel solutions: the derivation of the first solution involves one application of the first rule, the second solution is obtained by a repeated rule application.} "
Sergei Gorlatch