{"id":"https://openalex.org/W3040288220","doi":"https://doi.org/10.1145/3412932.3412935","title":"Counting immutable beans","display_name":"Counting immutable beans","publication_year":2019,"publication_date":"2019-09-25","ids":{"openalex":"https://openalex.org/W3040288220","doi":"https://doi.org/10.1145/3412932.3412935","mag":"3040288220"},"language":"en","primary_location":{"id":"doi:10.1145/3412932.3412935","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3412932.3412935","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st Symposium on Implementation and Application of Functional Languages","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/A5071042543","display_name":"Sebastian Ullrich","orcid":"https://orcid.org/0000-0002-2777-8117"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Sebastian Ullrich","raw_affiliation_strings":["Karlsruhe Institute of Technology, Germany"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045859619","display_name":"Leonardo de Moura","orcid":"https://orcid.org/0000-0002-5158-4726"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Leonardo de Moura","raw_affiliation_strings":["Microsoft Research"],"affiliations":[{"raw_affiliation_string":"Microsoft Research","institution_ids":["https://openalex.org/I4210164937"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071042543"],"corresponding_institution_ids":["https://openalex.org/I102335020"],"apc_list":null,"apc_paid":null,"fwci":2.2218,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.88241995,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9995999932289124,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9995999932289124,"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/T11424","display_name":"Security and Verification in Computing","score":0.9976999759674072,"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/computer-science","display_name":"Computer science","score":0.8758904933929443},{"id":"https://openalex.org/keywords/garbage-collection","display_name":"Garbage collection","score":0.7797654867172241},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.7381436824798584},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6670051217079163},{"id":"https://openalex.org/keywords/allocator","display_name":"Allocator","score":0.6423459053039551},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.5637208819389343},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5396625399589539},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5121290683746338},{"id":"https://openalex.org/keywords/memory-model","display_name":"Memory model","score":0.49793004989624023},{"id":"https://openalex.org/keywords/tracing","display_name":"Tracing","score":0.49748495221138},{"id":"https://openalex.org/keywords/garbage","display_name":"Garbage","score":0.47189244627952576},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.4555758535861969},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4373735785484314},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4062301516532898},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.21123561263084412}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8758904933929443},{"id":"https://openalex.org/C105122174","wikidata":"https://www.wikidata.org/wiki/Q322202","display_name":"Garbage collection","level":3,"score":0.7797654867172241},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7381436824798584},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6670051217079163},{"id":"https://openalex.org/C162262903","wikidata":"https://www.wikidata.org/wiki/Q343527","display_name":"Allocator","level":2,"score":0.6423459053039551},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.5637208819389343},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5396625399589539},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5121290683746338},{"id":"https://openalex.org/C12186640","wikidata":"https://www.wikidata.org/wiki/Q6815743","display_name":"Memory model","level":3,"score":0.49793004989624023},{"id":"https://openalex.org/C138673069","wikidata":"https://www.wikidata.org/wiki/Q322229","display_name":"Tracing","level":2,"score":0.49748495221138},{"id":"https://openalex.org/C75403996","wikidata":"https://www.wikidata.org/wiki/Q5521979","display_name":"Garbage","level":2,"score":0.47189244627952576},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.4555758535861969},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4373735785484314},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4062301516532898},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.21123561263084412},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3412932.3412935","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3412932.3412935","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st Symposium on Implementation and Application of Functional Languages","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W59787369","https://openalex.org/W1509600745","https://openalex.org/W1583464938","https://openalex.org/W1965601529","https://openalex.org/W1986388229","https://openalex.org/W1986402635","https://openalex.org/W2003498848","https://openalex.org/W2049384349","https://openalex.org/W2049820860","https://openalex.org/W2073904768","https://openalex.org/W2159430067","https://openalex.org/W2475728800","https://openalex.org/W2562114628","https://openalex.org/W2753707546","https://openalex.org/W2762233280","https://openalex.org/W4234823124","https://openalex.org/W4253706850"],"related_works":["https://openalex.org/W2165182245","https://openalex.org/W4230081292","https://openalex.org/W2112832394","https://openalex.org/W2165063050","https://openalex.org/W31759149","https://openalex.org/W2374437156","https://openalex.org/W45732507","https://openalex.org/W1559720592","https://openalex.org/W1967121117","https://openalex.org/W2182829270"],"abstract_inverted_index":{"Most":[0],"functional":[1,64,124],"languages":[2],"rely":[3],"on":[4,82],"some":[5],"kind":[6],"of":[7,21,42,60,95],"garbage":[8,24],"collection":[9],"for":[10,72,91,105,119,129],"automatic":[11],"memory":[12,75,85],"management.":[13],"They":[14],"usually":[15],"eschew":[16],"reference":[17,40,96],"counting":[18],"in":[19,57,115],"favor":[20],"a":[22,69,103,116],"tracing":[23],"collector,":[25],"which":[26],"has":[27],"less":[28],"bookkeeping":[29],"overhead":[30],"at":[31],"runtime.":[32],"On":[33],"the":[34,58,83,93],"other":[35],"hand,":[36],"having":[37],"an":[38,61,89,120],"exact":[39],"count":[41],"each":[43],"value":[44],"can":[45],"enable":[46],"optimizations":[47],"such":[48],"as":[49],"destructive":[50],"updates.":[51],"We":[52,67,87,110],"explore":[53],"these":[54,113],"optimization":[55],"opportunities":[56],"context":[59],"eager,":[62],"purely":[63,123],"programming":[65,125],"language.":[66],"propose":[68],"new":[70,117],"mechanism":[71],"efficiently":[73],"reclaiming":[74],"used":[76],"by":[77],"nonshared":[78],"values,":[79],"reducing":[80],"stress":[81],"global":[84],"allocator.":[86],"describe":[88],"approach":[90,137],"minimizing":[92],"number":[94],"counts":[97],"updates":[98],"using":[99],"borrowed":[100],"references":[101],"and":[102,122,140],"heuristic":[104],"automatically":[106],"inferring":[107],"borrow":[108],"annotations.":[109],"implemented":[111],"all":[112],"techniques":[114],"compiler":[118],"eager":[121],"language":[126],"with":[127],"support":[128],"multi-threading.":[130],"Our":[131],"preliminary":[132],"experimental":[133],"results":[134],"demonstrate":[135],"our":[136],"is":[138],"competitive":[139],"often":[141],"outperforms":[142],"state-of-the-art":[143],"compilers.":[144]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-11T08:14:18.477133","created_date":"2025-10-10T00:00:00"}