-
There's a new kid on the block: `Selective` functor, a sub-class of `Applicative` and super-class of `Monad` in the traditional hierarchy.
It is special by having a method `select: f (Either a b) -> …
-
`Either` naturally generalises as a monad transformer, `ExceptT`, and we've recently established that this is a bona fide `Selective` transformer, meaning that there is a natural instance `Selective f…
-
Comment thread for [Traversable: A Remix](https://duplode.github.io/posts/traversable-a-remix.html).
-
Is there for example an instance:
```haskell
instance Selective f => Selective (ReaderT r f a)
```
-
Hi! I want to make a form for an ADT. But can't figure how do I do that.
Given we have a type:
``` haskell
data Policy = Simple Int | Multi Int Int
```
How do we implement?
``` haskell
policyForm …
-
`:browse` at the REPL should really show which instances are defined as well.
-
Like a comment in the current definition [says](https://github.com/kefirjs/kefir/blob/master/src/interop/static-land.js#L27-L33), the definition is wrong:
```js
// This ap strictly speaking inco…
-
Hello there. I find it very nice to have an analog for `Applicative` for `Contravariant` functors. But it feels like something is missing; where are our nice `Traversable`s?
It seems like there is …
-
The `Applicative`typeclass can be presented in a fashion that makes the fact that it is a lax monoidal functor readily apparent:
```haskell
class Functor f => Apply f
where
zip :: (f a, f b)…
-
Could you provide some reference articles on GADTs and free monad? I have basic knowledge with haskell and monad. But do not know what free monad is.
Regarding the parallel and independent aspect, is…