On Tue, Dec 30, 2003 at 08:28:11PM +0100, Tomasz Zielonka wrote:
> On Wed, Dec 31, 2003 at 02:54:18AM +0900, Koji Nakahara wrote:
> > Hi,
> >
> > I think the problem is in the State Monad itself;
> > State Monad is lazy to compute its state.
> >
> > I am not a haskell expert, and there may be bet
On Wed, Dec 31, 2003 at 02:54:18AM +0900, Koji Nakahara wrote:
> Hi,
>
> I think the problem is in the State Monad itself;
> State Monad is lazy to compute its state.
>
> I am not a haskell expert, and there may be better ideas. But anyhow,
> when I use these >>>= and >>> instead of >>= and >>,
Hi,
I think the problem is in the State Monad itself;
State Monad is lazy to compute its state.
I am not a haskell expert, and there may be better ideas. But anyhow,
when I use these >>>= and >>> instead of >>= and >>,
your example runs fine. I hope it becomes some help.
m >>>= k = State $ \s
On Tue, Dec 30, 2003 at 02:12:15PM +, Joe Thornber wrote:
> Hi,
>
> I was wondering if anyone could give me some help with this problem ?
> I'm trying to hold some state in a StateMonad whilst I iterate over a
> large tree, and finding that I'm running out of stack space very
> quickly. The
Hi,
I was wondering if anyone could give me some help with this problem ?
I'm trying to hold some state in a StateMonad whilst I iterate over a
large tree, and finding that I'm running out of stack space very
quickly. The simplified program below exhibits the same problem.
This is the first tim
