{"id":"https://openalex.org/W2170441612","doi":"https://doi.org/10.1145/1133956.1133974","title":"Formal semantics of weak references","display_name":"Formal semantics of weak references","publication_year":2006,"publication_date":"2006-06-10","ids":{"openalex":"https://openalex.org/W2170441612","doi":"https://doi.org/10.1145/1133956.1133974","mag":"2170441612"},"language":"en","primary_location":{"id":"doi:10.1145/1133956.1133974","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1133956.1133974","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th international symposium on Memory management","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/A5111560785","display_name":"K. Donnelly","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kevin Donnelly","raw_affiliation_strings":["Boston University"],"affiliations":[{"raw_affiliation_string":"Boston University","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109208056","display_name":"Joseph J. Hallett","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. J. Hallett","raw_affiliation_strings":["Boston University"],"affiliations":[{"raw_affiliation_string":"Boston University","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090898185","display_name":"A. J. Kfoury","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Assaf Kfoury","raw_affiliation_strings":["Boston University"],"affiliations":[{"raw_affiliation_string":"Boston University","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111560785"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8608,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.88194789,"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":"126","last_page":"137"},"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.9998000264167786,"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.9998000264167786,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9980999827384949,"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/T10142","display_name":"Formal Methods in Verification","score":0.9855999946594238,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/haskell","display_name":"Haskell","score":0.8016085624694824},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7711275815963745},{"id":"https://openalex.org/keywords/garbage-collection","display_name":"Garbage collection","score":0.7446062564849854},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7384908199310303},{"id":"https://openalex.org/keywords/formal-semantics","display_name":"Formal semantics (linguistics)","score":0.5930187702178955},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.587364912033081},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.5061187148094177},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5033017992973328},{"id":"https://openalex.org/keywords/denotational-semantics","display_name":"Denotational semantics","score":0.49454328417778015},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37364524602890015},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.3252025842666626},{"id":"https://openalex.org/keywords/garbage","display_name":"Garbage","score":0.24498429894447327}],"concepts":[{"id":"https://openalex.org/C2780624054","wikidata":"https://www.wikidata.org/wiki/Q34010","display_name":"Haskell","level":3,"score":0.8016085624694824},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7711275815963745},{"id":"https://openalex.org/C105122174","wikidata":"https://www.wikidata.org/wiki/Q322202","display_name":"Garbage collection","level":3,"score":0.7446062564849854},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7384908199310303},{"id":"https://openalex.org/C146499914","wikidata":"https://www.wikidata.org/wiki/Q5469969","display_name":"Formal semantics (linguistics)","level":2,"score":0.5930187702178955},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.587364912033081},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.5061187148094177},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5033017992973328},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.49454328417778015},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37364524602890015},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.3252025842666626},{"id":"https://openalex.org/C75403996","wikidata":"https://www.wikidata.org/wiki/Q5521979","display_name":"Garbage","level":2,"score":0.24498429894447327}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1133956.1133974","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1133956.1133974","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th international symposium on Memory management","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.147.232","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.232","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.church-project.org/reports/electronic/Don+Hal+Kfo:BUCS-TR-2005-X.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W593998138","https://openalex.org/W1480674757","https://openalex.org/W1717653128","https://openalex.org/W1980939032","https://openalex.org/W2043698751","https://openalex.org/W2058821858","https://openalex.org/W2073569229","https://openalex.org/W2075872176","https://openalex.org/W2087960970","https://openalex.org/W2743310812","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2112263414","https://openalex.org/W1602185604","https://openalex.org/W3004782279","https://openalex.org/W2028779182","https://openalex.org/W4242678340","https://openalex.org/W2140654465","https://openalex.org/W2129253059","https://openalex.org/W4296274916","https://openalex.org/W1504459189","https://openalex.org/W1755575651"],"abstract_inverted_index":{"Weak":[0],"references":[1,3,77,110],"are":[2],"that":[4,74,131],"do":[5],"not":[6],"prevent":[7],"the":[8,60,100,104,107,121,128,155,173,176],"object":[9],"they":[10],"point":[11],"to":[12,25,51,91,102,126,137,146],"from":[13,81],"being":[14],"garbage":[15,152],"collected.":[16],"Many":[17],"realistic":[18],"languages,":[19],"including":[20],"Java,":[21],"SML/NJ,":[22],"and":[23,59,78,84,123,186],"Haskell":[24],"name":[26],"a":[27,45,57,66,70,117,162,187,194],"few,":[28],"support":[29],"weak":[30,41,76,96,109,163],"references.":[31,42,97],"However,":[32],"there":[33],"is":[34,79,89],"no":[35],"generally":[36],"accepted":[37],"formal":[38,46,67],"semantics":[39,47,68,88,105,177],"for":[40,69,106,120],"Without":[43],"such":[44,56],"it":[48],"becomes":[49],"impossible":[50],"formally":[52],"prove":[53],"properties":[54],"of":[55,149,175,197],"language":[58,122],"programs":[61],"written":[62],"in":[63,112],"it.We":[64],"give":[65],"calculus":[71],"called":[72],"\u03bbweak":[73],"includes":[75],"derived":[80],"Morrisett,":[82],"Felleisen,":[83],"Harper's":[85],"\u03bbgc.":[86],"The":[87],"used":[90,136],"examine":[92],"several":[93],"issues":[94],"involving":[95],"We":[98],"use":[99],"framework":[101],"formalize":[103],"key/value":[108],"found":[111],"Haskell.":[113],"Furthermore,":[114],"we":[115,143,171],"consider":[116],"type":[118,132],"system":[119],"show":[124,144],"how":[125,145],"extend":[127],"earlier":[129],"result":[130,196],"inference":[133],"can":[134],"be":[135,167],"collect":[138],"reachable":[139],"garbage.":[140],"In":[141],"addition":[142],"allow":[147],"collection":[148],"weakly":[150],"referenced":[151],"without":[153],"incurring":[154],"computational":[156],"overhead":[157],"often":[158],"associated":[159],"with":[160],"collecting":[161],"reference":[164],"which":[165,192],"may":[166],"later":[168],"used.":[169],"Lastly,":[170],"address":[172],"non-determinism":[174],"by":[178],"providing":[179],"both":[180],"an":[181],"effectively":[182],"decidable":[183],"syntactic":[184],"restriction":[185],"more":[188],"general":[189],"semantic":[190],"criterion,":[191],"guarantee":[193],"unique":[195],"evaluation.":[198]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}