🚀 go-pugleaf

In article 18783@eua.ericsson.se, joe@erix.ericsson.se (Joe Armstrong) writes:
>
>|> 
>|>    strangesucc n =	hd [x|x<-[0..];x>n];
>|> 
>	....
>|> 
>|>   - Stream.head(Stream.filter(fn x => x > 1000000,Stream.iota()));
>|>   
>|>   [Major collection... 21% used (3397260/15733684), 1920 msec]
>|>   
>|>   [Major collection... 21% used (3397288/15730836), 1910 msec]
>|>   
>|>   [Major collection... 21% used (3397288/15730948), 1920 msec]
>|>   
>|>   [Major collection... 21% used (3397288/15730888), 1920 msec]
>|>   
>|>   [Major collection... 21% used (3397288/15730888), 1910 msec]
>|>   val it = 1000001 : int
>|>   -
>
>	Wonderfull  !!
>
>	This is the kind of stuff that gives FP a bad name :-)
>
>	Is their a transformation system which can prove that
>
>	strangesucc x == x + 1 ?
>
>	Joe

I thought I should try this in Haskell, so I started Haskell B (the Chalmers implementation)
and I had no problem with 

	strangesucc 10000

Although it garbed three times it wasn't that slow. So ahead with some more courageus:

	strangesucc 100000

What happened ? Well:

	GC Stack Overflow !

So it's not only SML that has these problems. So what are some better mechanisms for 
representing backtracking OR how can You circumvent this problem ?

/Staffan Liljegren