Type-safe modular hash-consing (2006)
| Venue: | In: Proceedings of the 2006 workshop on ML |
| Citations: | 9 - 2 self |
BibTeX
@INPROCEEDINGS{Filliâtre06type-safemodular,
author = {Jean-christophe Filliâtre and Sylvain Conchon},
title = {Type-safe modular hash-consing},
booktitle = {In: Proceedings of the 2006 workshop on ML},
year = {2006},
pages = {12--19},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 speed up fundamental operations and data structures by several orders of magnitude when sharing is maximal. This paper introduces an OCAML hash-consing library that encapsulates hash-consed terms in an abstract datatype, thus safely ensuring maximal sharing. This library is also parameterized by an equality that allows the user to identify terms according to an arbitrary equivalence relation. D.2.3 [Software engineer-
Citations
| 2605 | Graph-based algorithms for Boolean function manipulation - Bryant - 1986 |
| 926 | A computing procedure for quantification theory - Davis, Putnam - 1960 |
| 636 | A machine program for theorem proving - Davis, Logemann, et al. - 1962 |
| 119 | Views: A way for pattern matching to cohabit with data abstraction - Wadler - 1987 |
| 46 | Vectorized garbage collection - Appel, Bendiksen - 1989 |
| 37 | On programming of arithmetic operations - Ershov - 1959 |
| 31 | Anatomy of LISP - Allen - 1978 |
| 30 | Monocopy and associative algorithms in extended Lisp - Goto - 1974 |
| 19 | Fast mergeable integer maps - Okasaki, Gill - 1998 |
| 11 | An Introduction to Binary Decision Diagrams. Lecture notes - Andersen - 1998 |
| 5 | Implementing functional languages with fast equality, sets and maps: an exercise in hash consing - Goubault - 1993 |
| 2 | Constructive Computation Theory. Courses notes.Available at http://pauillac.inria.fr/,huet/CCT - Huet |
