-
I found in [biparsing](https://github.com/BebeSparkelSparkel/biparsing) that a monadic `lmap` was very useful.
Is there an `lmapM :: (a -> m b) -> t m b c -> t m a c`?
-
Hi!
Is it possible to use a monadic action and specify an attribute in a grammar rule?
Example:
`MyRule { %myMonadicAction }`
I'd like to do something like this:
```
MyRule { %myMonadicAct…
-
- [x] I have read [CONTRIBUTING.md](https://github.com/idris-lang/Idris2/blob/main/CONTRIBUTING.md).
- [x] I have checked that there is no existing PR/issue about my proposal.
## Summary
I …
-
The method `tabulateRecordA` is great for building a record from a structure of `Applicative` actions. But when the action is a `Monad` we have even more freedom: we can choose to delay the "glue" ope…
-
As codebases are growing, it's increasingly intractable to pre-load all names, even with history excluded. (This applies to both UCM and Share.)
We want to just load the names that are needed for p…
-
Code which communicates with the underlying socket is monadic. Code which just analyses results computationally are pure. If you split this up, then it becomes easier to test the code base by invoking…
-
I just needed the following function, which turned out a bit trickier than I had expected:
```
foldlWithKeyM :: (Ord k, Monad m) => (k -> b -> a -> m b) -> b -> Map k a -> m b
foldlWithKeyM f z0 …
-
-
### Description of the task
Linux fullsystem currently builds with the `-std=c++2a` and `-fconcepts` flags on which enables some experimental implementations of C++20 features like [concepts](https…
-
Is there any plan to add support for monadic quickcheck like haskell?