News for hackers. Stuff that matters.
Re:Turn O(n^2) reverse into O(n) by velis_vel on Monday December 16, 2013 @12:12PM (#6916121)
> I find it interesting that correct equational reasoning in this case lead to a correct program, but one with absymal performance.

That's not really an interesting property of Haskell, though. You can always write correct but slow code in any language.

> It'd be interesting to think how one could encode performance characteristics into equations.

I've seen the concept of encoding performance in types played around with, but I can't find actual work (if any) that's been done on it.

Re:Turn O(n^2) reverse into O(n) by eru on Monday December 16, 2013 @10:32PM (#6919442)
> You can always write correct but slow code in any language.

Yes, but Haskell makes that exceptionally easy.