{"id":"https://openalex.org/W2121757479","doi":"https://doi.org/10.1145/1159876.1159880","title":"Type-safe modular hash-consing","display_name":"Type-safe modular hash-consing","publication_year":2006,"publication_date":"2006-09-16","ids":{"openalex":"https://openalex.org/W2121757479","doi":"https://doi.org/10.1145/1159876.1159880","mag":"2121757479"},"language":"en","primary_location":{"id":"doi:10.1145/1159876.1159880","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1159876.1159880","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 workshop on ML","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084552310","display_name":"Jean-Christophe Filli\u00e2tre","orcid":null},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Christophe Filli\u00e2tre","raw_affiliation_strings":["LRI, Universit\u00e9 Paris Sud, Orsay, France","[LRI, Universite Paris-Sud, Orsay, France]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LRI, Universit\u00e9 Paris Sud, Orsay, France","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I4210144804"]},{"raw_affiliation_string":"[LRI, Universite Paris-Sud, Orsay, France]","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I4210144804"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005087679","display_name":"Sylvain Conchon","orcid":null},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sylvain Conchon","raw_affiliation_strings":["LRI, Universit\u00e9 Paris Sud, Orsay, France","[LRI, Universite Paris-Sud, Orsay, France]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LRI, Universit\u00e9 Paris Sud, Orsay, France","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I4210144804"]},{"raw_affiliation_string":"[LRI, Universite Paris-Sud, Orsay, France]","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I4210144804"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.299,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":{"value":0.96742511,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"12","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.8765439987182617},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7286666631698608},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.6955899000167847},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6081709861755371},{"id":"https://openalex.org/keywords/sha-2","display_name":"SHA-2","score":0.576985239982605},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.5601541996002197},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5419290065765381},{"id":"https://openalex.org/keywords/hash-chain","display_name":"Hash chain","score":0.5224094390869141},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.48854026198387146},{"id":"https://openalex.org/keywords/perfect-hash-function","display_name":"Perfect hash function","score":0.4457453489303589},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.4437682628631592},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32754582166671753},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.22873780131340027},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21525874733924866},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1750704050064087}],"concepts":[{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.8765439987182617},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7286666631698608},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.6955899000167847},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6081709861755371},{"id":"https://openalex.org/C190157925","wikidata":"https://www.wikidata.org/wiki/Q1968605","display_name":"SHA-2","level":4,"score":0.576985239982605},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.5601541996002197},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5419290065765381},{"id":"https://openalex.org/C135783594","wikidata":"https://www.wikidata.org/wiki/Q5678864","display_name":"Hash chain","level":3,"score":0.5224094390869141},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.48854026198387146},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.4457453489303589},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.4437682628631592},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32754582166671753},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.22873780131340027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21525874733924866},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1750704050064087}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1159876.1159880","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1159876.1159880","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 workshop on ML","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.157.7076","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.7076","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lri.fr/~filliatr/ftp/publis/hash-consing2.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1795583176","https://openalex.org/W2008913431","https://openalex.org/W2057361103","https://openalex.org/W2062787735","https://openalex.org/W2062897452","https://openalex.org/W2080267935","https://openalex.org/W2114980032","https://openalex.org/W2127005994"],"related_works":["https://openalex.org/W2069568684","https://openalex.org/W2119251656","https://openalex.org/W4233341381","https://openalex.org/W4327727005","https://openalex.org/W2079868693","https://openalex.org/W1605991620","https://openalex.org/W1493980934","https://openalex.org/W3146427333","https://openalex.org/W2354004588","https://openalex.org/W1515612068"],"abstract_inverted_index":{"Hash-consing":[0],"is":[1,39,63],"a":[2],"technique":[3],"to":[4,24,73,77],"share":[5],"values":[6],"that":[7,48,69],"are":[8],"structurally":[9],"equal.":[10],"Beyond":[11],"the":[12,71],"obvious":[13],"advantage":[14],"of":[15,35],"saving":[16],"memory":[17],"blocks,":[18],"hash-consing":[19,46],"may":[20],"also":[21,64],"be":[22],"used":[23],"speed":[25],"up":[26],"fundamental":[27],"operations":[28],"and":[29],"data":[30],"structures":[31],"by":[32,66],"several":[33],"orders":[34],"magnitude":[36],"when":[37],"sharing":[38],"maximal.":[40],"This":[41,61],"paper":[42],"introduces":[43],"an":[44,53,67,78],"\\ocaml\\":[45],"library":[47,62],"encapsulates":[49],"hash-consed":[50],"terms":[51,75],"in":[52],"abstract":[54],"datatype,":[55],"thus":[56],"safely":[57],"ensuring":[58],"maximal":[59],"sharing.":[60],"parameterized":[65],"equality":[68],"allows":[70],"user":[72],"identify":[74],"according":[76],"arbitrary":[79],"equivalence":[80],"relation.":[81]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}