Peter Neyens

Relevant to this discussion is John De Goes' "post Free" presentation ([talk](https://www.youtube.com/watch?v=A-lmrvsUi2Y), [slides](https://www.slideshare.net/jdegoes/postfree-life-after-free-monads)).

An example of the code generated by a `@free` algebra that is used in the tests : ```scala { trait Y[FF$145[_]] extends _root_.freestyle.internal.EffectLike[FF$145] { def bar(x: Int): FS[Int] } @_root_.java.lang.SuppressWarnings(_root_.scala.Array("org.wartremover.warts.Any",...

It is probably at least worth investigating what we would need. - I imagine `Functor`, `Applicative`, `Monad` and `Traverse` ? - If we had a stack overflow using scalaz `traverse`...

You can implement `DataSourceCache` yourself and pass it when you run a `Fetch`. For the moment there are no ready made integrations with Redis / Memcached or ScalaCache ... That...

@gregbeech Fetch currently already exposes some of that information through `Env`, you could access the multiple rounds with the request executed in that round and how long that request took....

I think with `Concurrent` we should be able to implement `batch` in parallel as well. The code won't end up looking as nice as with `Par`, but that is probably...

> I think Par is worth having to avoid having to duplicate its implementation for types that have Concurrent. I think I disagree know with what I said almost 6...

Finally found some time to add a benchmark. Previous ``` [info] Benchmark (elems) (elemsPerChunk) Mode Cnt Score Error Units [info] CirceJsonStreamBench.encode_stream 100 50 avgt 5 54294.630 ± 13951.153 ns/op [info]...

This looks similar to @diesalbla's https://github.com/typelevel/fs2/pull/3197.