News for hackers. Stuff that matters.

A comment on The unreasonable effectiveness of declarative programming. Parent comment

Re:The unreasonable effectiveness of declarative programming by Lemmih on Tuesday May 19, 2020 @08:54AM (#23234303)
This is almost exactly how reanimate generates animations with Haskell: https://github.com/Lemmih/reanimate

Animations are frames over time and can be composed using 'seqA' and 'parA' combinators.

[ Parent | on HN ]
Re:The unreasonable effectiveness of declarative programming by reuben364 on Tuesday May 19, 2020 @10:57AM (#23235550)
One thing I realized that seq'ing too many things might be bad for performance. As I understand it,

   foldr1 (\x y -> ((x `par` delay 1) `seq` y)) $ map pure [1..]
Would require more and more comparisons over time. Is there some sort of codensity like trick that you can do? Or is this something the user of the library would worry about if it came to that. Or just have a redundant API.
[ Parent | on HN ]