Icelandjack
Icelandjack
Analogous to [`Control.Applicative.Lift`](https://hackage.haskell.org/package/transformers-0.5.4.0/docs/src/Control-Applicative-Lift.html) ```haskell data Lift f a = Pure a | Other (f a) ``` we can define ```haskell data Bilift f a b = Bipure a b |...
The order of `Fix` is unfortunate, it means that given a standard base functor ```haskell data FList a list = FNil | FCons a list instance Bifunctor FList where bimap...
Add `Compose f g a b` (= `Biff f g dentity a b`) from Edward's [monad homomorphisms](https://gist.github.com/ekmett/48f1b578cadeeaeee7a309ec6933d7ec#file-monadhom-hs-L314) ```haskell type COMPOSE f g = Biff f g Identity newtype Compose f...
Are any of these (/ inverses) useful ```haskell toSum :: Biff Either f g a a -> Sum f g a toSum (Biff (Left fa)) = InL fa toSum (Biff...
Here are 2 suggestions once we get `GHC.Generically` and `GHC.Generically1` in [base 4.17](https://github.com/ghc/ghc/blob/master/libraries/base/changelog.md). Those are simply newtypes, if you have a definition in terms of `GHC.Generic` or `GHC.Generic1` then you...
``` haskell pattern RETURN :: a -> Program instr a pattern RETURN x Return x) pattern BIND :: instr a -> (a -> Program instr b) -> Program instr b...
*async* has some functions that can be parameterized by optics from *lens*, is this something that is worth adding. ```haskell mapConcurrently :: Traversable t => (a -> IO b) ->...
Generate edge cases (`minBound`, `maxBound`, `minBound + 1`, ...) with some low frequency. --- `abs` always returns a positive number right? ``` haskell >>> quickCheck (\(n :: Int) -> abs...
May be of interest: [Integrated vs type based shrinking](http://hypothesis.works/articles/integrated-shrinking/)
Sometimes we want to generate structurally different but equal elements, for set we may want a generator for `Set [1,2,3]`, `Set [3,2,1]`, .. This is an idea to add `equivArbitrary`...