Hi,

Am Freitag, den 14.10.2016, 17:35 +0200 schrieb Damian Nadales:
> Do you have
> any experience using any of these approaches. If so would you mind
> sharing? ;)

I don’t have an answer to contribute, but I would be very interested in
hearing about experiences in terms of their relative runtime
performance.

My gut feeling is that an an indirect function call for every (>>=),
with many calls to `lift` each time, would make a deep monad
transformer stack much more expensive. A free monad approach seems to
be more sensible to me. But maybe GHC is doing a better job optimizing
this than I would think?

So if you have any number-supported evidence about this, possibly from
a real-world application where you tried to use one or the other,
please share it with us!

Thanks,
Joachim

--
Joachim “nomeata” Breitner
  mail@joachim-breitner.de • https://www.joachim-breitner.de/
  XMPP: nomeata@joachim-breitner.de • OpenPGP-Key: 0xF0FBF51F
  Debian Developer: nomeata@debian.org
_______________________________________________
Haskell-Cafe mailing list
To (un)subscribe, modify options or view archives go to:
http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe
Only members subscribed via the mailman list are allowed to post.