We’re rewarding the question askers & reputations are being recalculated! Read more.

All Questions

Filter by
Sorted by
Tagged with
1
vote
0answers
45 views

How can I prove impossibility of generalizing a given higher order function from pure to monadic or applicative?

There is a great divide in Haskell between pure and monadic algorithms. While the latter are indistinguishable from their usual imperative counterparts, the former can get much more magical. What this ...