(Enter summary)
Abstract: 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 and data structures, like equality test, 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 advantages. (Update)
Similar documents based on text: More All
0.5: Hash-consing Garbage Collection - Appel, Gonçalves (1993)
(Correct)
0.5: The Boyer Benchmark at Warp Speed - Baker (1992)
(Correct)
0.4: Implementing Functional Languages with Fast Equality, Sets and.. - Goubault (1994)
(Correct)
BibTeX entry: (Update)
@misc{ filliatre-hash,
author = "Jean-Christophe Filli{\^{a}}tre",
title = "Hash consing in an {ML} framework",
url = "citeseer.ist.psu.edu/401493.html" }
Citations (may not include all citations):
15
Hash-consing Garbage Collection
- Appel, Gon - 1993
15
Monocopy and associative algorithms in extended Lisp (context) - Goto - 1974
9
Fast Mergeable Integer Maps
- Okasaki, Gill - 1998
4
Implementing Functional Languages with Fast Equality
- Goubault - 1993
1
McGraw-Hill Book Compagny (context) - Allen, Lisp - 1978
Documents on the same site (http://www.lri.fr/~filliatr/liste_publis.en.html): More
Verification of Non-Functional Programs using Interpretations .. - Filliâtre
(Correct)
Formal Proof of a Program: Find - Filliâtre (2000)
(Correct)
A Theory of Monads Parameterized By Effects - Filliâtre (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC