Pascal Bourguignon wrote: > "Rob Thorpe" <[EMAIL PROTECTED]> writes: > > Anders J. Munch wrote: > >> jayessay wrote: > >> > Please note: GC is not part of CL's definition. It is likely not part > >> > of any Lisp's definition (for reasons that should be obvious), and for > >> > the same reasons likely not part of any language's definition. > >> > >> Really? So how do you write a portable program in CL, that is to run > >> for unbounded lengths of time? > > > > You can't. > > You can. Just use reversible operations. > > Or use pre-allocated objects. Yes, that means that you implement your > own memory management or garbage collector, but this would be portable.
I don't think there is any gaurantee in the spec that says that even doing nothing at all doesn't allocate more memory. AFAIK a conforming implementation could leak a fixed amount of memory per second. -- http://mail.python.org/mailman/listinfo/python-list
