{"id":"https://openalex.org/W2010138991","doi":"https://doi.org/10.1145/1328408.1328436","title":"Heap recycling for lazy languages","display_name":"Heap recycling for lazy languages","publication_year":2008,"publication_date":"2008-01-07","ids":{"openalex":"https://openalex.org/W2010138991","doi":"https://doi.org/10.1145/1328408.1328436","mag":"2010138991"},"language":"en","primary_location":{"id":"doi:10.1145/1328408.1328436","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328408.1328436","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation","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/A5101615144","display_name":"Jurriaan Hage","orcid":"https://orcid.org/0000-0002-3580-6069"},"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":"Jurriaan Hage","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/A5007122961","display_name":"Stefan Holdermans","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":false,"raw_author_name":"Stefan Holdermans","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/A5101615144"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":null,"apc_paid":null,"fwci":1.7162,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.86953298,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"189","last_page":"197"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9991000294685364,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.8258052468299866},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7940465807914734},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7310104370117188},{"id":"https://openalex.org/keywords/uniqueness","display_name":"Uniqueness","score":0.5481231808662415},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.5044203996658325},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4307786226272583},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4273388385772705},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19622671604156494}],"concepts":[{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.8258052468299866},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7940465807914734},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7310104370117188},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.5481231808662415},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.5044203996658325},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4307786226272583},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4273388385772705},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19622671604156494},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1328408.1328436","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328408.1328436","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.6399999856948853}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W811029122","https://openalex.org/W1507693023","https://openalex.org/W1551706119","https://openalex.org/W1555216982","https://openalex.org/W1556536463","https://openalex.org/W1581217527","https://openalex.org/W1603787199","https://openalex.org/W1980142751","https://openalex.org/W1980962065","https://openalex.org/W1998875295","https://openalex.org/W2004843654","https://openalex.org/W2033683103","https://openalex.org/W2068055184","https://openalex.org/W2074674709","https://openalex.org/W2098895495","https://openalex.org/W2136202785","https://openalex.org/W2163976959","https://openalex.org/W2166822586","https://openalex.org/W2485218432","https://openalex.org/W2561675875","https://openalex.org/W2752885492","https://openalex.org/W3102045914","https://openalex.org/W4252649616","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2019530272","https://openalex.org/W3136890312","https://openalex.org/W2259894237","https://openalex.org/W4312309273","https://openalex.org/W1578255156","https://openalex.org/W2479720249","https://openalex.org/W2132325017","https://openalex.org/W1923258046","https://openalex.org/W4299986738","https://openalex.org/W1671914757"],"abstract_inverted_index":{"Pure":[0],"functional":[1,92],"programming":[2],"languages":[3],"preclude":[4],"destructive":[5],"updates":[6,56],"of":[7,57,69],"heap-allocated":[8],"data.":[9],"In":[10],"such":[11],"languages,":[12],"all":[13],"newly":[14],"computed":[15],"algebraic":[16,58],"values":[17],"claim":[18],"freshly":[19],"allocated":[20],"heap":[21],"space,":[22],"which":[23],"typically":[24],"causes":[25],"idiomatic":[26],"programs":[27],"to":[28,34,77],"be":[29],"notoriously":[30],"inefficient":[31],"when":[32],"compared":[33],"their":[35],"imperative":[36],"and":[37,72,81],"impure":[38],"counterparts.":[39],"We":[40],"partly":[41],"overcome":[42],"this":[43],"shortcoming":[44],"by":[45],"considering":[46],"a":[47,67],"syntactically":[48],"light":[49],"language":[50],"construct":[51],"for":[52,89],"enabling":[53],"user-controlled":[54],"in-place":[55],"values.":[59],"The":[60],"resulting":[61],"calculus,":[62],"that":[63],"is":[64,75,82],"based":[65],"on":[66],"combination":[68],"type-based":[70],"uniqueness":[71],"constructor":[73],"analysis,":[74],"guaranteed":[76],"maintain":[78],"referential":[79],"transparency":[80],"fully":[83],"compatible":[84],"with":[85],"existing":[86],"run-time":[87],"systems":[88],"nonstrict,":[90],"pure":[91],"languages.":[93]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}