Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/unkindpartition/freemonad-benchmark
https://github.com/unkindpartition/freemonad-benchmark
Last synced: about 1 month ago
JSON representation
- Host: GitHub
- URL: https://github.com/unkindpartition/freemonad-benchmark
- Owner: UnkindPartition
- License: mit
- Created: 2014-06-06T11:36:21.000Z (over 10 years ago)
- Default Branch: master
- Last Pushed: 2016-11-29T12:04:45.000Z (about 8 years ago)
- Last Synced: 2024-10-22T04:21:29.147Z (3 months ago)
- Language: HTML
- Size: 396 KB
- Stars: 24
- Watchers: 4
- Forks: 7
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
This repository exists for archival purposes only. I am not interested in
maintaining it. **Please do not open pull requests.**
* * *
A benchmark comparing the performance of different free monad implementations.
The benchmark simulates the state monad using various flavors of free monads,
and compares them to the standard State monad from transformers.
See also: [Two failed attempts at extensible effects](https://ro-che.info/articles/2014-06-14-extensible-effects-failed).
Note that this is *not* a comparison of extensible effects system. Free
monads *may* be used to implement an extensible effect system.
Under most implementations, extensible effects introduce an even bigger overhead
(dispatching upon the effect requests); this overhead is not present in this
benchmark. However, if your free monad is slow (which it probably is, as this
benchmark shows), any effect system based on it won't be fast.
## Running the benchmark
stack build && stack exec freemonad-benchmark -- -o results.html
## Results
[Criterion report](https://rawgit.com/feuerbach/freemonad-benchmark/master/results.html)
## Implementations
1. **Free**
``` haskell
data Free f a = Pure a | Free (f (Free f a))
```
2. **Free/lazy**
The same standard Free monad emulating the lazy State monad.
3. **Church**
The Church-encoded free monad:
``` haskell
newtype ChurchFree f a = ChurchFree
{ runChurchFree :: forall w. (a -> w) -> (f w -> w) -> w }
```
4. **Codensity**
The standard Free monad, codensity-transformed. See
[Asymptotic Improvement of Computations over Free Monads](http://www.janis-voigtlaender.eu/papers/AsymptoticImprovementOfComputationsOverFreeMonads.pdf).
5. **NoRemorse**
A free monad from [Reflection without Remorse](http://okmij.org/ftp/Haskell/zseq.pdf).
6. **Freer**
The Freer monad from [Freer Monads, More Extensible
Effects](http://okmij.org/ftp/Haskell/extensible/more.pdf), aka the
[operational]() monad.
## Workloads
For every implementation, there are two tests, for left- and right-associated
chains of binds. Some free monads (e.g. the standard one) suffer from quadratic
complexity on left-associated chains of binds.