Hi,
I've been working my way through CTM. One of my
friends and I were having a discussion about
programming languages and he was praising HAskell and
its "Monad io".
I looked up haskell and monads in CTM and noticed
that it isn't clear how *exactly* monads fit in. The
part on haskell does not go into detail on monads and
on page 332 there are few sentences
"The solution used in HAskell is more complicated: to
avoid explicit state and instead use a kind of
accumulator called a monad .. uses higher order
progarmming to make state threading implicit.."
So does this mean monads are an alternate path to
explicit state representation in programming
languages? Where do monads fit into the series of
kernel langauges presented in CTM?
Any help much
appeciated,
Regards,
Ravi
__________________________________
Yahoo! for Good - Make a difference this year.
http://brand.yahoo.com/cybergivingweek2005/
_________________________________________________________________________________
mozart-users mailing list
[email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-users
