Some parallel programming examples using homomorphisms
Stephen Eriksson-Bique – 22 April 1998
The goal is to show that programming which is based on a solid mathematical foundation can be fairly easy and intuitive and the resulting program often possesses massive implicit parallelism. We have successfully written nearly homomorphic functions for for all of our case studies. This work is a continuation of Murray Cole's paper Parallel Programming, List Homomorphisms and the Maximum Segment Sum Problem.