Hi, George, thanks for the pointer, it led me to some interesting
reading. Alas, the problem which it solves was already solved, and the
unsolved problem didn't yield any further...
At this point, I've concluded that my interpreter just simply isn't
tail-recursive enough: in the Collatz test case
I believe there might be an elegant solution for this using the `Last` monoid
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 7/5/09, Alexander Dunlap wrote:
> On Sun, Jul 5, 2009 at 7:46 PM, Uwe Hollerbach
> wrote:
>> On 7/5/09, Paul L wrote:
>>> Previously you had lastOrNil taking m [a] as input, presumably
>>> generated by mapM. So mapM is actually building an entire list before
>>> it returns the argument for you
On Sun, Jul 5, 2009 at 7:46 PM, Uwe Hollerbach wrote:
> On 7/5/09, Paul L wrote:
>> Previously you had lastOrNil taking m [a] as input, presumably
>> generated by mapM. So mapM is actually building an entire list before
>> it returns the argument for you to call lastOrNil. This is where you
>> had
On 7/5/09, Paul L wrote:
> Previously you had lastOrNil taking m [a] as input, presumably
> generated by mapM. So mapM is actually building an entire list before
> it returns the argument for you to call lastOrNil. This is where you
> had unexpected memory behavior.
>
> Now you are "fusing" lastOr
Previously you had lastOrNil taking m [a] as input, presumably
generated by mapM. So mapM is actually building an entire list before
it returns the argument for you to call lastOrNil. This is where you
had unexpected memory behavior.
Now you are "fusing" lastOrNil and mapM together, and instead of
On 7/4/09, Marcin Kosiba wrote:
> On Saturday 04 July 2009, Uwe Hollerbach wrote:
>> Good evening, all, following up on my question regarding space leaks,
>> I seem to have stumbled across something very promising. I said I was
>> using this tiny function "lastOrNil" to get the last value in a lis
On Saturday 04 July 2009, Uwe Hollerbach wrote:
> Good evening, all, following up on my question regarding space leaks,
> I seem to have stumbled across something very promising. I said I was
> using this tiny function "lastOrNil" to get the last value in a list,
> or the empty (scheme) list if the
Good evening, all, following up on my question regarding space leaks,
I seem to have stumbled across something very promising. I said I was
using this tiny function "lastOrNil" to get the last value in a list,
or the empty (scheme) list if the haskell list was empty. The uses of
it were all of the