SIGN IN
SIGN UP
Hashconsing in an incrementally garbage-collected system: a story of weak pointers and hashconsing in ocaml 3.10.2
Full Text:
Pdf
Buy this Article
Authors:
Pascal Cuoq
Commissariat a l'Energie Atomique, Saclay, France
Damien Doligez
Instritut National de Recherche en Informatique et Automatique, Rocquencourt, France
Published in:
· Proceeding
ML '08
Proceedings of the 2008 ACM SIGPLAN workshop on ML
Pages 13-22
ACM
New York, NY
, USA
©2008
table of contents
ISBN: 978-1-60558-062-3
doi>
10.1145/1411304.1411308
2008 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 12
· Downloads (cumulative): 227
· Citation Count: 1
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
ICFP'13
Share:
|
Tags:
coding tools and techniques
design
garbage collection
hash-consing
maximal sharing
ocaml
performance
weak hashtables
weak pointers
weak references
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder