J.-C. Filliâtre. Hash consing in an ML framework. Research Report 1368, LRI, Université Paris Sud, September 2000.

Hash consing is a technique to share values that are structurally equal. Beyond the obvious advantage of saving memory blocks, hash consing may also be used to gain speed in several operations (like equality test) and data structures (like sets or maps) when sharing is maximal. However, physical adresses cannot be used directly for this purpose when the garbage collector is likely to move blocks underneath. We present an easy solution in such a framework, with many practical benefits.

[ bib | .ps.gz ]

Back