{"id":"https://openalex.org/W2129642457","doi":"https://doi.org/10.1145/1863495.1863500","title":"Generic storage in Haskell","display_name":"Generic storage in Haskell","publication_year":2010,"publication_date":"2010-09-26","ids":{"openalex":"https://openalex.org/W2129642457","doi":"https://doi.org/10.1145/1863495.1863500","mag":"2129642457"},"language":"en","primary_location":{"id":"doi:10.1145/1863495.1863500","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1863495.1863500","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th ACM SIGPLAN workshop on Generic programming","raw_type":"proceedings-article"},"type":"article","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/A5073385979","display_name":"Sebastiaan Visser","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Sebastiaan Visser","raw_affiliation_strings":["Utrecht University, Utrecht, Netherlands"],"affiliations":[{"raw_affiliation_string":"Utrecht University, Utrecht, Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027537142","display_name":"Andres L\u00f6h","orcid":"https://orcid.org/0000-0002-7492-7293"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Andres L\u00f6h","raw_affiliation_strings":["Utrecht University, Utrecht, Netherlands"],"affiliations":[{"raw_affiliation_string":"Utrecht University, Utrecht, Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073385979"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":null,"apc_paid":null,"fwci":1.7806,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.86386763,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"10","issue":null,"first_page":"25","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9973999857902527,"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"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9947999715805054,"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/heap","display_name":"Heap (data structure)","score":0.854922354221344},{"id":"https://openalex.org/keywords/haskell","display_name":"Haskell","score":0.8410437107086182},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8124998807907104},{"id":"https://openalex.org/keywords/sketch","display_name":"Sketch","score":0.7522681951522827},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.7104007601737976},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.6725617051124573},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5951557159423828},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.5215499401092529},{"id":"https://openalex.org/keywords/linked-list","display_name":"Linked list","score":0.494099885225296},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4923352003097534},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46751219034194946},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.44498610496520996},{"id":"https://openalex.org/keywords/functor","display_name":"Functor","score":0.4338095188140869},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.4327545762062073},{"id":"https://openalex.org/keywords/garbage-collection","display_name":"Garbage collection","score":0.41299039125442505},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26589298248291016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14432600140571594},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.13911697268486023},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.11405417323112488}],"concepts":[{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.854922354221344},{"id":"https://openalex.org/C2780624054","wikidata":"https://www.wikidata.org/wiki/Q34010","display_name":"Haskell","level":3,"score":0.8410437107086182},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8124998807907104},{"id":"https://openalex.org/C2779231336","wikidata":"https://www.wikidata.org/wiki/Q7534724","display_name":"Sketch","level":2,"score":0.7522681951522827},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.7104007601737976},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.6725617051124573},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5951557159423828},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.5215499401092529},{"id":"https://openalex.org/C146101286","wikidata":"https://www.wikidata.org/wiki/Q7003418","display_name":"Linked list","level":2,"score":0.494099885225296},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4923352003097534},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46751219034194946},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.44498610496520996},{"id":"https://openalex.org/C156772000","wikidata":"https://www.wikidata.org/wiki/Q864475","display_name":"Functor","level":2,"score":0.4338095188140869},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4327545762062073},{"id":"https://openalex.org/C105122174","wikidata":"https://www.wikidata.org/wiki/Q322202","display_name":"Garbage collection","level":3,"score":0.41299039125442505},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26589298248291016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14432600140571594},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.13911697268486023},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.11405417323112488},{"id":"https://openalex.org/C75403996","wikidata":"https://www.wikidata.org/wiki/Q5521979","display_name":"Garbage","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1863495.1863500","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1863495.1863500","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th ACM SIGPLAN workshop on Generic programming","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W50416634","https://openalex.org/W192458036","https://openalex.org/W1523648047","https://openalex.org/W1527090010","https://openalex.org/W1604039591","https://openalex.org/W1608714802","https://openalex.org/W1726062507","https://openalex.org/W1891773423","https://openalex.org/W1968028066","https://openalex.org/W1994001680","https://openalex.org/W2018014973","https://openalex.org/W2018665307","https://openalex.org/W2058137890","https://openalex.org/W2076018351","https://openalex.org/W2098037505","https://openalex.org/W2120926795","https://openalex.org/W2129990308","https://openalex.org/W2141759034","https://openalex.org/W2143041463","https://openalex.org/W2145738007","https://openalex.org/W2148944677","https://openalex.org/W2160809209","https://openalex.org/W2163552400","https://openalex.org/W2166117753","https://openalex.org/W2167268698","https://openalex.org/W2175912519","https://openalex.org/W2478545561","https://openalex.org/W2913811625","https://openalex.org/W4244792373"],"related_works":["https://openalex.org/W1700460898","https://openalex.org/W1524351898","https://openalex.org/W4297378365","https://openalex.org/W2524496484","https://openalex.org/W1487406077","https://openalex.org/W2147299991","https://openalex.org/W1588734579","https://openalex.org/W4250131244","https://openalex.org/W2148255588","https://openalex.org/W2335513707"],"abstract_inverted_index":{"We":[0,63],"present":[1],"a":[2,20,24,80,89,97],"framework":[3,43],"for":[4],"constructing":[5],"functional":[6],"data":[7,16,36],"structures":[8,17],"that":[9,38],"can":[10,75],"be":[11,76],"stored":[12],"on":[13,46,104],"disk.":[14],"The":[15,42],"reside":[18],"in":[19,23,69],"heap":[21],"saved":[22],"binary":[25,105],"file.":[26],"Operations":[27],"read":[28],"and":[29,54],"write":[30],"only":[31],"the":[32,35,57],"parts":[33],"of":[34,52,71,100],"structure":[37],"are":[39],"actually":[40],"needed.":[41],"is":[44],"based":[45,103],"expressing":[47],"datatypes":[48],"as":[49],"fixed":[50],"points":[51],"functors":[53],"then":[55],"annotating":[56],"recursive":[58],"positions":[59],"with":[60],"additional":[61],"information.":[62],"explain":[64],"how":[65,94],"functions,":[66],"if":[67],"expressed":[68],"terms":[70],"standard":[72],"recursion":[73],"patterns,":[74],"easily":[77],"lifted":[78],"from":[79],"pure":[81],"setting":[82],"to":[83,95],"an":[84],"effectful,":[85],"annotated":[86],"scenario.":[87],"As":[88],"running":[90],"example,":[91],"we":[92],"sketch":[93],"implement":[96],"persistent":[98],"library":[99],"finite":[101],"maps":[102],"search":[106],"trees.":[107]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}