Remove the use of foldr (>=>) and use the same primitive recursion
that is used in the repa example for solving Laplace's equation. We
still get much worse performance than I would expect though.

For 2,000,000 steps:

real	0m22.084s
user	0m21.972s
sys	0m0.106s