Re: Storage management, was Compiler writers will love this language

haberg@matematik.su.se (Hans Aberg) writes:
|> nmm1@cus.cam.ac.uk (Nick Maclaren) wrote:
|>
|> >|> I don't believe anyone has ever fixed the cyclic graph problem with
|> >|> reference-counting.
|> >
|> >As it is theoretically impossible to fix, that seems likely :-)
|>
|> It is not impossible to make versions (but not pure ref count) that can
|> trace cyclicity in some circumstances:


Yes, indeed. The theoretical impossibility is for the general case,
as usual.


|> If one should get around this dynamically created cycles problem, perhaps
|> one ends up on essentially a tracing algorithm.


It could well be. The papers I have seen 'solve' the problem have
handled only the static case.




Regards,
Nick Maclaren.

Return to the comp.compilers page.
Search the comp.compilers archives again.