From: Wolfram Kahl <kahl@cas.mcmaster.ca>
So technically, the lost sharing is the second-order sharing that is preserved
in ``optimal reduction'' of lambda calculi [Levy-1980, Lamping-1990, Asperti-Laneve-1992],
while hash consing normally is directly usable only for first-order sharing.
Wolfram
Last updated: Nov 21 2024 at 12:39 UTC