-
Right now in our Agda implementation, we have a module parameter functor for the span monad, where we use the IO monad when we want to write to send progress updates to the front end, and the id monad…
-
I occasionally have an issue when first loading a file where the REPL doesn't display a prompt. Simply typing a value in signals the error below, and then starts the prompt. It's not a show-stopper, b…
-
Hello! I've been refreshing my microbenchmark suite and ran into this problem.
Step 0:
```scala
def program: Int < Vars[Int] =
Vars.get[Int].flatMap: n =>
if n
-
given the `Monad` instance for `Possible`, the following fails to hold:
```
MissingData >> b = MissingData >>= \_ -> b
```
while this is not a law per se, it is generally expected that
```
a >> b =…
ghost updated
9 years ago
-
In `EffectKind.lean` we have a bunch of lemmata that take proofs of known theorems as statements, e.g.
```lean
@[simp] theorem liftEffect_pure_impure [Monad m] (hle : pure ≤ impure) :
liftEffe…
goens updated
6 months ago
-
```
Checking 'Submultiplicative euclidean function' law for EuclideanRing
999/1000 test(s) passed.
/Users/jacereda/src/purescript/purescript-quickcheck-laws/output/Control.Monad.Eff.Exception/forei…
-
We can use http://hackage.haskell.org/package/quickcheck-classes package to check the laws using QuickCheck. Especially since we have many typeclasses it is a good idea to check the laws automatically…
-
I'm opening this issue as a centralized place to discuss and review the current design of the generic Computation Expressions.
The main issue of the current design was highlighted by @cmeeren recen…
gusty updated
4 years ago
-
I am using typescript and would like to use futils,
It would be very grace to support typescript definition file
-
the `indexArrayM` docs read:
```haskell
-- | Monadically read a value from the immutable array at the given index.
-- This allows us to be strict in the array while remaining lazy in the read
--…