-
I love this package and use it wherever I can, as I love functional programming. The only thing that bothers me a little is the lack of documentation.
Would'nt it be a nice idea to document the cod…
-
During last Office Hours in FSSF Slack we've discussed the idea of promoting bounties as a model of monetizing OSS and getting more contributors to F# projects.
For those unfamiliar with bounty mo…
-
I wish to use the free monad to abstract away some effectful code. I'm trying first with: a case to get an IQueryable of specified type, another case to get map from one type to another type (probably…
-
## 📖 Documentation
I'm trying to understand how some of the constructs in `fp-ts` work but there are no good tutorials on the site and the module documentation is either non-existent or very uninfo…
-
The current definitions of `listen` and `pass` are:
```haskell
instance (Monoid w, HasState tag w m)
=> HasWriter tag w (WriterLog m)
where
writer_ tag (a, w) = yield_ tag w >> pure a
…
-
As discussed in [this SO post](http://stackoverflow.com/q/39928488/1477667), the `Monad m` constraint on `hoist` feels too strong in the face of `hoist id = id`. Cirdec thinks it probably should be `F…
-
The standard says in https://github.com/dhall-lang/dhall-lang/blob/master/standard/equivalence.md
> Note that this definition of equivalence does not include η-equivalence, so λ(f : Bool → Bool) → …
-
Hi,
It will be great if we can have such a Redux-Saga implementation.
-
Hi everyone,
This can be about general FP topics in R but we can start by continuing the maybe discussion.
I have a few use-cases for maybe:
1. Data IO
2. Handling "impure" data
3. Function…
armcn updated
2 years ago
-
I really want to like `freer-simple`, but I can't until it infers at least as well as idiomatic mtl usage. The big problem at the moment is `Member`:
```haskell
class FindElem eff effs => Member (…