Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,548,575 papers from all fields of science
Search
Sign In
Create Free Account
Hash consing
Known as:
Hash cons
, Hashcons
In computer science, particularly in functional programming, hash consing is a technique used to share values that are structurally equal. The term…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Communications of the ACM
Computer science
Dynamic programming
Eiichi Goto
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Variational lists: comparisons and design guidelines
Karl Smeltzer
,
Martin Erwig
Feature-oriented software development
2017
Corpus ID: 3586387
Variation is widespread in software artifacts (data and programs) and in some cases, such as software product lines, is widely…
Expand
2016
2016
Performance Modeling of Maximal Sharing
M. Steindorfer
,
J. Vinju
International Conference on Performance…
2016
Corpus ID: 15274098
It is noticeably hard to predict the effect of optimization strategies in Java without implementing them. "Maximal sharing" (a.k…
Expand
2007
2007
Edit and verify
Radu Grigore
,
Michał Moskal
arXiv.org
2007
Corpus ID: 6461933
Automated theorem provers are used in extended static checking, where they are the performance bottleneck. Extended static…
Expand
2006
2006
Function memoization and unique object representation for ACL2 functions
R. Boyer
,
W. Hunt
International Workshop on the ACL2 Theorem Prover…
2006
Corpus ID: 859344
We have developed an extension of ACL2 that includes the implementation of hash-based association lists and function memoization…
Expand
2002
2002
The Wizard of TILT: Efficient?, Convenient, and Abstract Type Representations
Tom Murphy
2002
Corpus ID: 9653367
Abstract : TILT is a certifying compiler for Standard ML [1]. Its major distinguishing feature is the use of Typed Intermediate…
Expand
2001
2001
EÆcient Hash-Consing of Recursive Types
Jeffrey Considine
2001
Corpus ID: 15067802
EÆcient storage of types within a compiler is necessary to avoid large blowups in space during compilation. Recursive types in…
Expand
2000
2000
Efficient Hash-Consing of Recursive Types
Jeffrey Considine
2000
Corpus ID: 117883607
Abstract Efficient storage of types within a compiler is necessary to avoid large blowups in space during compilation. Recursive…
Expand
2000
2000
Efficient Hash-Consing of Recursive Types Considine
2000
Corpus ID: 10263371
EÆcient storage of types within a compiler is necessary to avoid large blowups in space during compilation. Recursive types in…
Expand
2000
2000
Efficient Hash-Consing of Recursive Types
øöö Blockinø
2000
Corpus ID: 17465056
2000
2000
2000-0401 Deciding Isomorphisms of Simple Types in Polynomial Time Considine
2000
Corpus ID: 13170932
The isomorphisms holding in all models of the simply typed lambda calculus with surjective and terminal objects are well studied…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE