-
The error below occurred while running the tests for the new `SuperLinearAlgebra` package in an [s390x PPA build in Ubuntu 20.04](https://launchpadlibrarian.net/526940905/buildlog_ubuntu-focal-s390x.m…
-
http://fprog.ru/2009/issue1/dan-piponi-haskell-monoids-and-their-uses/
-
Tim Davis wrote:
Many algorithms use a MIN-SECOND or MIN-FIRST semiring, to find the parent in the BFS tree, for example. The MIN is not always strictly required. A faster monoid would be based on…
-
During a recent conversation between @davidchambers and I, we came up with a way to define an Applicative Const Functor that can be used to implement Lenses, without needing a Monoid up front. The con…
-
Spotted this refactoring opportunity that HLint doesn't warn me about:
```haskell
> f g xs = mconcat . fmap g $ xs
> :t f
f :: Monoid c => (a -> c) -> [a] -> c
> :t foldMap
foldMap :: (Foldabl…
-
I wrote some utilities for Vinyl, namely:
- Reverse casting, together with a slicing lens and a newtype with a different monoid instance (uses the monoid instance for (f (el $ field)) rather than lift…
ghost updated
9 years ago
-
Even though it's not in `Data.List` it would be cool to have a `Fold` for testing if all elements are the same. Sketch of an implementation, comment if you have a nicer way of constructing this `Monoi…
-
The list monoid has the annoying property of being inefficient (caching concerns aside) when left-mappended in a long chain. This is particularly annoying since that's the way the `Writer` monad combi…
-
Or at least a few of them.
-
This ticket gives a implementation of beta-adic monoids, as described in the article http://www.latp.univ-mrs.fr/~paul.mercat/Publis/Semi-groupes%20fortement%20automatiques.pdf
It permit to compute …