{"id":"https://openalex.org/W4310506209","doi":"https://doi.org/10.1145/3564719.3568698","title":"Deep Fusion for Efficient Nested Recursive Computations","display_name":"Deep Fusion for Efficient Nested Recursive Computations","publication_year":2022,"publication_date":"2022-11-29","ids":{"openalex":"https://openalex.org/W4310506209","doi":"https://doi.org/10.1145/3564719.3568698"},"language":"en","primary_location":{"id":"doi:10.1145/3564719.3568698","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564719.3568698","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 21st ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences","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/A5025737201","display_name":"Amir Shaikhha","orcid":"https://orcid.org/0000-0002-9062-759X"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Amir Shaikhha","raw_affiliation_strings":["University of Edinburgh, UK"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5025737201"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":0.6812,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67671692,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"33","last_page":"44"},"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.9997000098228455,"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.9997000098228455,"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/T10142","display_name":"Formal Methods in Verification","score":0.9972000122070312,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9970999956130981,"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/recursion","display_name":"Recursion (computer science)","score":0.9073350429534912},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7800872921943665},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.7600180506706238},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.693782389163971},{"id":"https://openalex.org/keywords/fusion","display_name":"Fusion","score":0.5099567174911499},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40065431594848633},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3102990984916687},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2790640592575073}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.9073350429534912},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7800872921943665},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.7600180506706238},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.693782389163971},{"id":"https://openalex.org/C158525013","wikidata":"https://www.wikidata.org/wiki/Q2593739","display_name":"Fusion","level":2,"score":0.5099567174911499},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40065431594848633},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3102990984916687},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2790640592575073},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3564719.3568698","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564719.3568698","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 21st ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences","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":38,"referenced_works":["https://openalex.org/W1520355364","https://openalex.org/W1542011821","https://openalex.org/W1546597693","https://openalex.org/W1561487379","https://openalex.org/W1598796492","https://openalex.org/W1600766624","https://openalex.org/W1939001241","https://openalex.org/W1966981171","https://openalex.org/W1968863783","https://openalex.org/W1969375478","https://openalex.org/W1979811002","https://openalex.org/W2002871272","https://openalex.org/W2026049208","https://openalex.org/W2029138494","https://openalex.org/W2033229728","https://openalex.org/W2059267851","https://openalex.org/W2081124914","https://openalex.org/W2081834155","https://openalex.org/W2088675571","https://openalex.org/W2106771621","https://openalex.org/W2117818027","https://openalex.org/W2130872776","https://openalex.org/W2159227002","https://openalex.org/W2295914203","https://openalex.org/W2340838390","https://openalex.org/W2562640456","https://openalex.org/W2644985445","https://openalex.org/W2751836142","https://openalex.org/W2773027441","https://openalex.org/W2916488864","https://openalex.org/W2962773216","https://openalex.org/W2966177220","https://openalex.org/W2966295917","https://openalex.org/W3203017718","https://openalex.org/W3216635194","https://openalex.org/W4233720472","https://openalex.org/W4281692593","https://openalex.org/W4301270244"],"related_works":["https://openalex.org/W1976679120","https://openalex.org/W4281614748","https://openalex.org/W2377519369","https://openalex.org/W2765883196","https://openalex.org/W3202311233","https://openalex.org/W2034826746","https://openalex.org/W2396919090","https://openalex.org/W2379816237","https://openalex.org/W2369572737","https://openalex.org/W4310506209"],"abstract_inverted_index":{"One":[0],"of":[1,5,17,46,112,118,139,151],"the":[2,10,43,88,101,109,116,119,129,149],"performance":[3,150],"bottlenecks":[4],"nested":[6,47,70,152,155],"recursive":[7,48],"computations":[8,66],"is":[9,58],"intermediate":[11,33,80,134],"collections":[12,71,81,90,135],"created":[13],"at":[14,136],"different":[15,137],"levels":[16,121],"recursion.":[18,140],"The":[19,52,79],"existing":[20],"techniques":[21],"such":[22,32,72],"as":[23,73],"vertical":[24],"and":[25,69,77,157],"horizontal":[26],"loop":[27],"fusion":[28,107,127,146],"do":[29],"not":[30],"remove":[31],"allocations.":[34],"This":[35],"paper":[36],"proposes":[37],"deep":[38,106,126,145],"fusion,":[39],"a":[40,59],"technique":[41],"for":[42,122],"efficient":[44],"compilation":[45,56],"computation":[49],"over":[50,154],"collections.":[51],"input":[53],"to":[54,114,131],"our":[55],"framework":[57],"high-level":[60],"functional":[61],"program":[62],"that":[63,144],"can":[64,147],"represent":[65],"on":[67],"flat":[68],"lists,":[74],"sets,":[75],"bags,":[76],"maps.":[78,158],"are":[82,91],"removed":[83],"in":[84],"three":[85],"levels.":[86],"First,":[87],"immutable":[89],"translated":[92],"into":[93],"mutable":[94],"ones":[95],"by":[96],"leveraging":[97],"in-place":[98,123],"updates":[99],"using":[100],"destination-passing":[102],"style":[103],"technique.":[104],"Second,":[105],"enables":[108],"inner":[110],"level":[111],"recursion":[113,153],"reuse":[115],"destinations":[117],"outer":[120],"updates.":[124],"Third,":[125],"removes":[128],"need":[130],"allocate":[132],"tiny":[133],"depths":[138],"Our":[141],"experiments":[142],"show":[143],"improve":[148],"lists":[156]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}