[Nickle] Fwd: nickle slow for large factorials

[Keith Packard]

On Mon, 5 Jul 2010 10:01:21 +0200, Michel Alexandre Salim <michael.silvanus at gmail.com> wrote:

> I forgot to mention that this is in fact what I implemented, and htop
> still reports memory consumption in the hundreds of megabytes, and !
> does so too. I wonder if nickle's numerical system is leaking memory?

I suspect the nickle compiler just didn't figure out that you were doing
tail recursion; in particular, it doesn't figure it out if you're using
?: instead of if/then/else. Did you send me a copy of the code before? I
can't find it now.

-- 
keith.packard at intel.com
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 189 bytes
Desc: not available
URL: </pipermail/nickle/attachments/20100705/522e23ba/attachment.pgp>