Pascal Voitot

Actually yes everything is loaded in memory to be efficient or as you supposed, it would take too long to read one row. But I rely on Pandas just because...

@fanf Can you precise a bit? ``` type O = Foo :&: Bar :&: Toto :&: Nil Foo[Bar[List[Option[A]]].OnionN[_2, O] // should OnionN seek in depth in type O or in...

now you would have to write something like: ``` type O = Xor[E, ?] :&: Bulb for { a

yep that' s the case I was speaking about... the important isn't only the `O` but what you want to keep in your `Xor[E, List[D]]`... `Xor[E, List[D]].onionN[O, 1]` would take...

which full stack, the one you give in input or the onion?

actually if you look at package.scala, for now, I had to create an implicit conversion for every stack `F[A]`, `F[G[A]]`, `F[G[H[A]]]`... so I feel OnionN isn't so easy for now...

oh sorry guys, I had missed those msg... Thks for contribs! @sscarduzio @marcin-rzeznicki plz push your PR on https://github.com/ProjectSeptemberInc/freek which is the official freek project ;)

That's not false even if the vast majority of DSL we tend to use are compiled into effectful computations actually... That's why I speak about effects but as you say,...

I'll change a few sentences to remove this fake `effect`-oriented impression... I think there is still something better to do with effects... Eff & others are yet a bit too...

I'm eager to see your new Free representation actually! I've tried pushing optimized CoproductK structure for compiling recently in Freek... There are things to do around these ideas of optimized...