Mon Jul 30 22:59:11 CEST 2007
> I think the point tsuraan is making here (correct me if I'm wrong,
> tsuraan) is that the combination of prebuilt abstractions (zipwith and
> sum (or more generally, fold)) is more desirable than a hand-coded
> explicitly recursive function because the abstractions are more
> 'functional style' (something I would agree with--in other communities
> (Haskell coming to mind), it is strongly encouraged to use common
> abstractions, even to the point where using explicit recursion is
> sometimes discouraged). But the problem is that these abstractions, or
> at least the combination of them, are slower than a hand-coded
> function explicit recursion function. So, is there any way to make the
> natural abstractions work as fast as the hand-coded version?
Yeah, that's the question I'm going for :)
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the erlang-questions