-
I worked out a way to compose cofree comonads:
http://try.purescript.org/?gist=b31f48d16ad43cec8c0afcd470ac5add
there is the function:
```
compose
:: forall f g a b
. Functor f
=> Func…
-
-
The verifier logic could benefit from a small refactoring, mainly from two things:
* Remove the `MonadIO m` requirement and introduce a VerifierM monad transformer.
* Allow verifiers to access mul…
-
This is original link which is not working:
https://yow.eventer.com/yow-lambda-jam-2015-1305/cofun-with-cofree-comonads-by-david-laing-1891
I askeda about it too on twitter, no answer yet
https:/…
-
# Sam Tay | Who needs HashLife when you have comonads?
Improving a naive implementation of the Game of Life with an elegant and performant solution.
[https://samtay.github.io/posts/comonadic-game-of…
-
Hi! I wanted to let you know about a subtle but pretty fundamental bug we've found in Haskell's recursion-schemes library. Since Matryoshka uses the same "recursion-schemes from comonads" approach as …
-
Cats already has the infix operator for Monad >>= which is very useful and expressive for chaing efectful functions.
Both haskell and scalaz also provide the fish operator >=> for kleisli compositi…
-
no idea if this is something to put in your talk, but I was reading [the docs for underscore.js' `chain()` and `value()`](http://underscorejs.org/#chaining) today and thought "hmm, does chain return …
-
Hello,
This is a followup to a question I asked on Twitter. I'm working on some code to calculate "betweenness centrality", with a view to applying it to streetmap graphs. I'm not sure if Alga is a…
-
Right now effects are essentially Store comonads
``` haskell
Store i o = (i, i -> o)
```
where the function is allowed to be a side-effecting Scala procedure. This means that having a stack of effec…