Aleksey Khudyakov

Yes it's clearly a programmer error so failure should be loud. Now you need to specifically enable tracing and look for problems there.

I looked into this performance problem a bit. Here's slightly modified benchmark from top post. I used instruction counting. It's easy to measure and almost deterministic and I believe would...

### On naming Precedent of using `Maybe` suffix is wider than just `readMaybe`: `bitSizeMaybe` and oddities like `naturalToWordMaybe`, `minusNaturalMaybe`. It's on the long side but not unbearably so. Overall I...

This is getting nowhere. But I think it would be useful to decide on naming conventions for total counterparts. From cursory haddock search it seems there are 3 existing conventions:...

So there's an unanimous support for the `Maybe` suffix. Which we should use

> I believe «maybe …» is the best choice. So say what. I am going to write whichever names I want and then before merging code into vector I shall...

After some thought I think `foldl1Maybe` is actually valuable. It is possible to express it in terms of `foldl` but it's not very compact. And what's worse it's easy to...

`uncons` based approach is not fusible. As aside `vector` mixes up functions based on stream-fusion and relying on slice. I should create issue about this. We should compile list of...

I think it's better to avoid adding such instance. Instance assumes that there's singe reasonable definition of function for a given type. But for Complex we have several possible implementations...

Just few functions: ```haskell -- | Generate numbers |z| < 1 unitDisk :: StatefulGen g m => g -> m (Complex a) -- | Generate numbers r1 < |z| <...