[plt-scheme] polymorphism of primitive types

From: Yoav Goldberg (yoav.goldberg at gmail.com)
Date: Tue Oct 18 13:42:38 EDT 2005

> > How much memory will the graph of "1000 alternations of 1 and 2
> > followed by 1000 alternations of 3 and 4" consume when constructed?
> > (from what I understand, it will be like the equivalent list, which is
> > ~2000. I would much prefer the lazy version in this case...)
> You are creating and applying a closure.
> There is an entire paper about how often people really need laziness
> (FPCA 94 or 95). And the surprising thing is: little. Or not at all.
> The good thing is that you want strict functions and lazy data
> constructors, because that's the justified version.

I'm afraid I didn't understand what you meant to say here...


Posted on the users mailing list.