[Haskell-cafe] Computing a sorted list of products lazily

[porges at porg.es]

I did something similar a while ago to solve a problem posted on StackOverflow:

http://porg.es/blog/sorted-sums-of-a-sorted-list

Henry Laxen generalized my code a little bit so you can pass in any monotonic function (see the comments).

I'm not sure of the laziness properties of this, but it might be lazy enough... you may need to swap for a boxed array.
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 270 bytes
Desc: OpenPGP digital signature
Url : http://www.haskell.org/pipermail/haskell-cafe/attachments/20090418/1d8f971e/signature.bin