## MLton 20241230+git20251029+dfsg-5

# Reachability

Reachability is a notion dealing with the graph of heap objects maintained at runtime. Nodes in the graph are heap objects and edges correspond to the pointers between heap objects. As the program runs, it allocates new objects (adds nodes to the graph), and those new objects can contain pointers to other objects (new edges in the graph). If the program uses mutable objects (refs or arrays), it can also change edges in the graph.

At any time, the program has access to some finite set of root nodes, and can only ever access nodes that are reachable by following edges from these root nodes. Nodes that are unreachable can be garbage collected.

## Also see

- MLtonFinalizable

- MLtonWeak