Dmitrii Kovanikov
Dmitrii Kovanikov
Without this instance it's impossible to perform partial pattern-matching inside property-based tests. Maybe this instance can be somehow smart, like, discard all cases that doesn't match the case?
Those functions can be polymorphic. Also we can add `fromLazy` and `toLazy` for convenience. Also either deprecate `toLText` or add `toLByteString` or only add `toLByteString` and remove `fromStrict` and `toStrict`...
Currently `whenLeft` has this type: ```haskell whenLeft :: Applicative f => Either l r -> (l -> f ()) -> f () ``` I propose to rename `whenLeft` to `whenLeft_`...
Currently there're a lot of boilerplatish content in `.hlint.yaml` file (like suggestions to use functions from `universum`, not other libraries). Specifying all such suggestions manually is not really convenient. What...
I propose to add next instance `MonadFail` for `Either`: ```haskell instance IsString str => MonadFail (Either str) where fail = Left . fromString ``` Proposed earlier: https://github.com/aelve/haskell-issues/issues/53
This issue is a call to discussion. I want to discuss several things and come to agreement on several issues: - [ ] Decide how to avoid type families duplication....
I propose to think of type class for `Map`-like things. This is really convenient to have. For example, if you want to `insert` into `newtype` wrappers around `Map/HashMap`. `mono-traversable` [has...
Add this function: ```haskell safe f = fmap f . nonEmpty ``` We export some functions to work with `NonEmpty`. But sometimes we want functions to work with `[]` and...
Currently `whenJust` has the following type signature: ```haskell whenJust :: Applicative f => Maybe a -> (a -> f ()) -> f () ``` I propose to generalize types of...
Sometimes it's useful to have the following functions: ```haskell every :: (Bounded a, Enum a) => [a] -- all values cycleSucc :: (Bounded a, Enum a) => a -> a...