On Thu, Sep 29, 2016 at 4:28 PM, Jake <jake.waksbaum@gmail.com> wrote:

I think this may have something to do with the default definition of many in the definition of Alternative:
many :: f a -> f [a]
many v = many_v
  where
    many_v = some_v <|> pure []
    some_v = (fmap (:) v) <*> many_v
many_v and some_v are mutually recursive functions, and it may be that this prevents the thunks from being made available to take in some way. I'm really not sure though, this is just an idea about why this is not quite the same as (take $ repeat 1)

The problem is that many is creating an infinite sum that’s nested to the left. So you’re trying to compute

(((… <|> Just [1,1,1]) <|> Just [1,1]) <|> Just [1]) <|> Just 1

which will never terminate because Maybe is strict in the first argument to <|>.

As a practical matter, the Alternative instance for Maybe should probably be changed to either call error or return Just (repeat v).

Similarly, we should probably flip the order for many in the instance for [].

Dave Menendez <dave@zednenem.com>
<http://www.eyrie.org/~zednenem/>