Sjoerd Visscher
Sjoerd Visscher
There's this f.e. https://hackage.haskell.org/package/MemoTrie-0.6.7/docs/Data-MemoTrie.html
I would expect the generics based code to look like this: ``` import qualified GHC.Generics as Gen class Distributive f => Representable f where type Rep f :: * type...
My hunch is that the [Morphism](https://github.com/statebox/cql/blob/master/src/Language/CQL/Morphism.hs) type should be the square.
@mstn We now have this: https://github.com/statebox/idris-ct/blob/master/idris2/Basic/Adjunction.idr This compiles in Idris-2, but this definition throws the Idris-1 compiler in an infinite loop, and similarly other definitions were either looping or just...
Inelegant code is better than code that doesn't compile! Idris 2 is still very much in flux, and is missing a lot of features still, but it is actually working...
Regarding naming, since we have: ```Haskell consumeFoldable :: (Consumable a, Foldable f) => f a %1 -> () consumeFoldable = foldMap consume moveTraversable :: (Movable a, Traversable t) => t...
Can somebody explain `allocBeside` to me? Having an unrestricted empty Array makes sense to me, so if that means that with `allocBeside` you can get any Array as `Unrestricted` could...
I think for data functors the domain and codomain should be allowed to differ? So: ```haskell fmap :: (a %p -> b) -> f a %q -> f b ```
Shouldn't this be `v2022-04-06`? @ak3n?
I didn't try it, but ST is in the UHC repository: https://github.com/uhc/uhc/blob/master/EHC/ehclib/base/Control/Monad/ST.hs