In my
previous post, I described in general terms how state transformations are represented in functional languages like Haskell that don't have the concept of mutable state (assignment to variables). There are different ways to do this, but the way that most closely simulates the way things work in imperative languages is by using state monads.
(
Read more... )
Comments 9
I blew a gasket a few weeks ago on a particularly bad Haskell tutorial and yours is one of the first Monad tutorials to really make sense to me.
Reply
Reply
Reply
Reply
Seriously you have a talent for explaining things logically and at a good pace (which not all book writers have). Maybe write a book about the black-hole of Haskell monadic functional programming? I should think that a book on that is really in demand since usually people get on well with Haskell until the term Monad crops up.
Thanks for taking the time to write these posts.
Reply
Reply
Reply
I have also read the Y combinator articles. They are really good.
Reply
Reply
Leave a comment