"List homomorphisms are functions which can be efficiently computed in parallel since they suit the divide-and-conquer paradigm ideally. We propose a simple approach to testing whether a function is a homomorphism and, if so, determining how it can be parallelized. The approach is based on analyzing two inherently sequential representations of functions based on cons- and snoc-lists. For some interesting functions which are not homomorphisms, e.g. the maximum segment sum problem, our method provides a systematic way of embedding into a homomorphism."