Article

Type-safe modular hash-consing

Authors:

Jean-Christophe Filliâtre,

Sylvain ConchonAuthors Info & Claims

ML '06: Proceedings of the 2006 workshop on ML

Pages 12 - 19

https://doi.org/10.1145/1159876.1159880

Published: 16 September 2006 Publication History

Get Access

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.

References

[1]

The Objective Caml language. http://caml.inria.fr/.

Google Scholar

[2]

John Allen. Anatomy of Lisp. McGraw-Hill Book Compagny, 1978.

Digital Library

Google Scholar

[3]

Henrik Reif Andersen. An Introduction to Binary Decision Diagrams. Lecture notes, 1998. http://www.itu.dk/people/hra/.

Google Scholar

[4]

Andrew W. Appel and Marcelo J. R. Gonçalves. Hash-consing Garbage Collection. Technical Report CS--TR--412--93, Princeton University, February 1993.

Google Scholar

[5]

Randal E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, 8(C-35):677--691, 1986.

Digital Library

Google Scholar

[6]

M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5(7):394--397, July 1962.

Digital Library

Google Scholar

[7]

M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(3):201--215, July 1960.

Digital Library

Google Scholar

[8]

A. P. Ershov. On programming of arithmetic operations. Commun. ACM, 1(8):3--6, 1958.

Digital Library

Google Scholar

[9]

Eiichi Goto. Monocopy and associative algorithms in extended Lisp. Technical Report TR 74--03, University of Tokyo, May 1974.

Google Scholar

[10]

Jean Goubault. Implementing Functional Languages with Fast Equality, Sets and Maps: an Exercise in Hash Consing. In Journées Francophones des Langages Applicatifs (JFLA'93), pages 222--238, Annecy, February 1993.

Google Scholar

[11]

Gérard Huet. Constructive Computation Theory. Courses notes. Available at http://pauillac.inria.fr/~huet/CCT/.

Google Scholar

[12]

Chris Okasaki and Andrew Gill. Fast Mergeable Integer Maps. In Workshop on ML, pages 77--86, September 1998.

Google Scholar

[13]

Philip Wadler. Views: A way for pattern matching to cohabit with data abstraction. In 14th ACM Symposium on Principles of Programming Languages, Munich, January 1987.

Digital Library

Google Scholar

Cited By

View all

Blaauwbroek LOlšák MGeuvers H(2024)Hashing Modulo Context-Sensitive 𝛼-EquivalenceProceedings of the ACM on Programming Languages10.1145/36564598:PLDI(2027-2050)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656459
Lesbre DLemerre M(2024)Compiling with Abstract InterpretationProceedings of the ACM on Programming Languages10.1145/36563928:PLDI(368-393)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656392
Sistla MChaudhuri SReps T(2024)CFLOBDDs: Context-Free-Language Ordered Binary Decision DiagramsACM Transactions on Programming Languages and Systems10.1145/365115746:2(1-82)Online publication date: 2-May-2024
https://dl.acm.org/doi/10.1145/3651157
Show More Cited By

Index Terms

Type-safe modular hash-consing
1. Software and its engineering
  1. Software notations and tools

Recommendations

Global abstraction-safe marshalling with hash types
ICFP '03: Proceedings of the eighth ACM SIGPLAN international conference on Functional programming

Type abstraction is a key feature of ML-like languages for writing large programs. Marshalling is necessary for writing distributed programs, exchanging values via network byte-streams or persistent stores. In this paper we combine the two, developing ...
Type-safe linking and modular assembly language
POPL '99: Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Linking is a low-level task that is usually vaguely specified, if at all, by language definitions. However, the security of web browsers and other extensible systems depends crucially upon a set of checks that must be performed at link time. Building ...
Squid: type-safe, hygienic, and reusable quasiquotes
SCALA 2017: Proceedings of the 8th ACM SIGPLAN International Symposium on Scala

Quasiquotes have been shown to greatly simplify the task of metaprogramming. This is in part because they hide the data structures of the intermediate representation (IR), instead allowing metaprogrammers to use the concrete syntax of the language they ...

Comments

Information & Contributors

Information

Published In

ML '06: Proceedings of the 2006 workshop on ML

September 2006

102 pages

ISBN:1595934839

DOI:10.1145/1159876

Program Chairs:
Andrew Kennedy
Microsoft Research Cambridge
,
François Pottier
INRIA Rocquencourt, Paris

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 September 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

ICFP06

Sponsor:

ICFP06: ACM SIGPLAN International Conference on Functional Programming

September 16, 2006

Oregon, Portland, USA

Acceptance Rates

Overall Acceptance Rate 6 of 11 submissions, 55%

Upcoming Conference

ICFP '25

Sponsor:
sigplan

ACM SIGPLAN International Conference on Functional Programming

October 12 - 18, 2025

Singapore , Singapore

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

44
Total Citations
View Citations
465
Total Downloads

Downloads (Last 12 months)49
Downloads (Last 6 weeks)1

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Blaauwbroek LOlšák MGeuvers H(2024)Hashing Modulo Context-Sensitive 𝛼-EquivalenceProceedings of the ACM on Programming Languages10.1145/36564598:PLDI(2027-2050)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656459
Lesbre DLemerre M(2024)Compiling with Abstract InterpretationProceedings of the ACM on Programming Languages10.1145/36563928:PLDI(368-393)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656392
Sistla MChaudhuri SReps T(2024)CFLOBDDs: Context-Free-Language Ordered Binary Decision DiagramsACM Transactions on Programming Languages and Systems10.1145/365115746:2(1-82)Online publication date: 2-May-2024
https://dl.acm.org/doi/10.1145/3651157
Cheng XWang JSui YRoychoudhury APaiva AAbreu RStorey M(2024)Precise Sparse Abstract Execution via Cross-Domain InteractionProceedings of the IEEE/ACM 46th International Conference on Software Engineering10.1145/3597503.3639220(1-12)Online publication date: 20-May-2024
https://dl.acm.org/doi/10.1145/3597503.3639220
Monniaux D(2024)Pragmatics of formally verified yet efficient static analysis, in particular, for formally verified compilersInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-024-00760-326:4(463-477)Online publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1007/s10009-024-00760-3
Lermusiaux PMontagu B(2024)Detection of Uncaught Exceptions in Functional Programs by Abstract InterpretationProgramming Languages and Systems10.1007/978-3-031-57267-8_15(391-420)Online publication date: 6-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-57267-8_15
Baudon TRadanne GGonnord L(2023)Bit-Stealing Made Legal: Compilation for Custom Memory Representations of Algebraic Data TypesProceedings of the ACM on Programming Languages10.1145/36078587:ICFP(813-846)Online publication date: 31-Aug-2023
https://dl.acm.org/doi/10.1145/3607858
Ozdemir ABrown FWahby R(2022)CirC: Compiler infrastructure for proof systems, software verification, and more2022 IEEE Symposium on Security and Privacy (SP)10.1109/SP46214.2022.9833782(2248-2266)Online publication date: May-2022
https://doi.org/10.1109/SP46214.2022.9833782
Monniaux DBoulmé S(2022)The Trusted Computing Base of the CompCert Verified CompilerProgramming Languages and Systems10.1007/978-3-030-99336-8_8(204-233)Online publication date: 5-Apr-2022
https://dl.acm.org/doi/10.1007/978-3-030-99336-8_8
Chaudhari SAparna RRane A(2021)A Survey on Proxy Re-Signature Schemes for Translating One Type of Signature to AnotherCybernetics and Information Technologies10.2478/cait-2020-002821:3(24-49)Online publication date: 1-Sep-2021
https://dl.acm.org/doi/10.2478/cait-2020-0028
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Global abstraction-safe marshalling with hash types

Type-safe linking and modular assembly language

Squid: type-safe, hygienic, and reusable quasiquotes

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations