-
This is a proposal for allowing generics as type parameters. It's currently possible to write specific examples of monads, but in order to write the interface that all monads satisfy, I propose writi…
-
For example, the algebraic laws for categories say that, for any arrow `f`. `f;id == id;f == f`. These laws are essential for functors and monads.
-
I was reading the following in the ‘general-advice' chapter: “Creating class hierarchies is a good way to get frustrated with Meteor”. Which pretty much blew my mind: What else? Being still a pretty y…
-
http://blog.sigfpe.com/2006/08/you-could-have-invented-monads-and.html
http://book.realworldhaskell.org/read/using-parsec.html
http://haskell.org/haskellwiki/Introduction_to_QuickCheck
-
"shrink" is not defined in the README which makes it harder for newcomers to understand the package.
It seems that there are two big aspects in the package, generation of data and iteration over da…
-
In #110 we started using a pure and parallel `solve` function; which meant we could remove `IO` from the symbolic engine altogether! :tada:
Yet, the [`SymEval`](https://github.com/tweag/pirouette…
-
Inspired by @tomstuart's lovely [talk on monads in Ruby](https://codon.com/refactoring-ruby-with-monads), I'd like to dip our feet in with Rails on the Many monad.
Tom has [gracefully permitted](ht…
-
We could have functors, applicatives, monads for things like `TreeSets`, if we require result types to be `Comparable`, or force to provide a `Comparator`. Would it be worth the trouble?
-
Oleg, in `Freer Monads, More Extensible Effects`, describes the implementation of Fluet and Morrisett’s “monadic regions”, which are like a nested `ST` monad.
-
I've been studying the library and its test suite, trying to come to terms with monads.
I became interested in the test which is commented out on [line 269](https://github.com/jduey/protocol-monads/b…