What if my Monad transformer module (for example Logic transformer shown in the video) has a StateT inside it and I need the updated state for future bind calls to my module? Wouldn't the lift function unwrap the whole transformer and thus my state is lost?
You know it would be awesome if there were IDEs or GHCI front-ends that automatically did type-tetris for you [rearrange arguments when you get the order wrong, automatically lift and unlift arguments so that they are the right type like those autofix in Java IDEs]. Its really important for Monad transformers and Monadic code. The IDEs could also use rewrite rules to hide the Monad transformers as well showing an alternate view of code that is easy to understand rather than those zygo-ana-hylo-morphs.... and help you convert pure code to monadic code and back again... I was trying to build a simple code linter in Template Haskell, but I still need to learn more.
![fellow fellow - พรุ่งนี้ไม่มีใครรู้ feat. INK WARUNTORN [OFFICIAL MV]](http://i.ytimg.com/vi/QP6JyjYx_W0/mqdefault.jpg)
Code and slides at github.com/benkolera/talk-stacking-your-monads
Slides also at stackingyourmonads.benkolera.com/
What if my Monad transformer module (for example Logic transformer shown in the video) has a StateT inside it and I need the updated state for future bind calls to my module? Wouldn't the lift function unwrap the whole transformer and thus my state is lost?
Great talk, please stop panning away from the slides when he explains them though :D
At 25:40 runApp e = flip runReaderT e . (runExceptT . unApp) and compiles
aha! you are absolute right, we should run the outer layer first!
You know it would be awesome if there were IDEs or GHCI front-ends that automatically did type-tetris for you [rearrange arguments when you get the order wrong, automatically lift and unlift arguments so that they are the right type like those autofix in Java IDEs]. Its really important for Monad transformers and Monadic code. The IDEs could also use rewrite rules to hide the Monad transformers as well showing an alternate view of code that is easy to understand rather than those zygo-ana-hylo-morphs.... and help you convert pure code to monadic code and back again... I was trying to build a simple code linter in Template Haskell, but I still need to learn more.