-
-
- [ ] 翻译
- [ ] 校对
-
Relative adjunctions, monads, algebras and prove that the forgetful functor from algebras reflects limits.
-
The problem is described in the comments of the following code:
```fstar
// Two monads, with returns and binds
assume val m1: Type0 -> Type0
assume val m2: Type0 -> Type0
assume val return1: …
-
See [Stefan Hoeck's thread](https://discord.com/channels/827106007712661524/827106088343175180/1157021237801910394) in Discord
Unfortunately, the current implementation of ST does not provide the…
-
Hello everybody,
I wanted to share a technique that technically shouldn't be possible in Dart, but that is possible in Dart. It is based on a technique that Rúnar Bjarnason introduces in his talk […
-
There is an instance `Monoid w => MonadAccum w (AccumT w Identity)`:
https://github.com/haskell/mtl/blob/6be8cb55ca9a8bfa6111e3004e4b56b91ed5edcc/Control/Monad/Accum.hs#L163
But a more general i…
-
Similar to #3309, but using record disambiguation to bamboozle the type inference of F*:
```fstar
// Two monads, with returns and binds
assume val m1: Type0 -> Type0
assume val m2: Type0 -> Type…
-
Version 0.3.0.0 changed the type of `withResource` from
```haskell
MonadBaseControl IO m => Pool a -> (a -> m b) -> m b
```
to
```haskell
Pool a -> (a -> IO r) -> IO r
```
I'm not the …
-
Help...related to #1693.
```
f : {m, n} (n < m) => [m] -> [n]
f x = take x
```
```
Cryptol> f (zero : [inf]) : [inf]
cryptol: You have encountered a bug in Cryptol's implementation.
*** Pl…