Comments on: State Monads in Haskell http://www.brool.com/index.php/state-monads-in-haskell brool \brool\ (n.) : a low roar; a deep murmur or humming Wed, 16 Nov 2011 04:35:53 +0000 hourly 1 http://wordpress.org/?v=3.3 By: Alexandr http://www.brool.com/index.php/state-monads-in-haskell/comment-page-1#comment-123209 Alexandr Fri, 06 May 2011 07:34:19 +0000 http://www.brool.com/?p=169#comment-123209 Good day! Thank you for the post, it is very helphul to understand State Monads. But I think, example is very synthetic. Just look to this: f :: [Integer] -> [Bool] f xs = reverse $ f' $ reverse $ xs where f' [] = [] f' (x:xs) = [not (x `elem` xs)] ++ f' xs It looks better, is not it? Good day! Thank you for the post, it is very helphul to understand State Monads.

But I think, example is very synthetic. Just look to this:

f :: [Integer] -> [Bool]
f xs = reverse $ f’ $ reverse $ xs
where
f’ [] = []
f’ (x:xs) = [not (x `elem` xs)] ++ f’ xs

It looks better, is not it?

]]> By: Harry Xingzhi Pan http://www.brool.com/index.php/state-monads-in-haskell/comment-page-1#comment-119624 Harry Xingzhi Pan Wed, 09 Mar 2011 00:49:02 +0000 http://www.brool.com/?p=169#comment-119624 I believe in the third code block "found" should be "state". Okay now I continue to read... I believe in the third code block “found” should be “state”.
Okay now I continue to read…

]]>