Parallelizing functional programs by generalization
Published in Journal of Functional Programming • Nov 1, 1999
NobleIDNI1P05W65R67S10
Authors:,
Alfons Geser
Sergei Gorlatch
Abstract
List homomorphisms are functions that are parallelizable using the divide-and-conquer paradigm. We study the problem of finding homomorphic representations of functions in the Bird–Meertens constructive theory of lists, by means of term rewriting and theorem proving techniques. A previous work prove...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!