> If I have.. > data Path = L Path | R Path | T > paths = T : branch paths > branch (p:ps) = L p : R p : branch ps > > This will be a CAF which can never be garbage collected, but > may grow indefinitely large as it gets reduced. Correct?
Any decent compiler will garbage collect the CAF when it is no longer needed. However, this does not solve the problem that the CAF could grow very large whilst its value is still required. Regards, Malcolm _______________________________________________ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell