You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In some language implementations you can reason over how GC can be done in a more efficient way (E.g. Erjang). In this context it would be helpful on being able to specify likely candidates for collection and perhaps groups of objects which will not hold references to other object groups.
In addition to be able to specify immutability and additional constraints on referencing (only referenced locally, escape).
In addition the ability to allocate outside the normal GC and specify own GC algo.
Also ability to specify a reference counting strategy in languages this is more plausible.
The text was updated successfully, but these errors were encountered:
In some language implementations you can reason over how GC can be done in a more efficient way (E.g. Erjang). In this context it would be helpful on being able to specify likely candidates for collection and perhaps groups of objects which will not hold references to other object groups.
In addition to be able to specify immutability and additional constraints on referencing (only referenced locally, escape).
In addition the ability to allocate outside the normal GC and specify own GC algo.
Also ability to specify a reference counting strategy in languages this is more plausible.
The text was updated successfully, but these errors were encountered: