{"id":"https://openalex.org/W4414977295","doi":"https://doi.org/10.1145/3764117","title":"From Linearity to Borrowing","display_name":"From Linearity to Borrowing","publication_year":2025,"publication_date":"2025-10-09","ids":{"openalex":"https://openalex.org/W4414977295","doi":"https://doi.org/10.1145/3764117"},"language":"en","primary_location":{"id":"doi:10.1145/3764117","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3764117","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3764117","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3764117","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007268028","display_name":"Andrew Wagner","orcid":"https://orcid.org/0000-0002-9434-0780"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Wagner","raw_affiliation_strings":["Northeastern University, Boston, USA"],"raw_orcid":"https://orcid.org/0000-0002-9434-0780","affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002771065","display_name":"Olek Gierczak","orcid":"https://orcid.org/0009-0002-8850-0984"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Olek Gierczak","raw_affiliation_strings":["Northeastern University, Boston, USA"],"raw_orcid":"https://orcid.org/0009-0002-8850-0984","affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5118139269","display_name":"Brianna Marshall","orcid":null},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brianna Marshall","raw_affiliation_strings":["Northeastern University, Boston, USA"],"raw_orcid":"https://orcid.org/0000-0002-7744-4932","affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035957556","display_name":"John M. Li","orcid":"https://orcid.org/0000-0003-2130-5092"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John M. Li","raw_affiliation_strings":["Northeastern University, Boston, USA"],"raw_orcid":"https://orcid.org/0000-0003-2130-5092","affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084250644","display_name":"Amal Ahmed","orcid":"https://orcid.org/0000-0001-7424-572X"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amal Ahmed","raw_affiliation_strings":["Northeastern University, Boston, USA"],"raw_orcid":"https://orcid.org/0000-0001-7424-572X","affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, USA","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I12912129"],"apc_list":null,"apc_paid":null,"fwci":1.1946,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.8539634,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"9","issue":"OOPSLA2","first_page":"3981","last_page":"4007"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9890999794006348,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9805999994277954,"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/soundness","display_name":"Soundness","score":0.9199000000953674},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.572700023651123},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.43939998745918274},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.41100001335144043},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.3937999904155731},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.3589000105857849},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.3346000015735626},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3197999894618988}],"concepts":[{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.9199000000953674},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6000000238418579},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.572700023651123},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5580999851226807},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.43939998745918274},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.41100001335144043},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4011000096797943},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.3937999904155731},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3833000063896179},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3675999939441681},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.3589000105857849},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.3346000015735626},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3197999894618988},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3158999979496002},{"id":"https://openalex.org/C2776350369","wikidata":"https://www.wikidata.org/wiki/Q843479","display_name":"Control logic","level":2,"score":0.3075000047683716},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.2903999984264374},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.2863999903202057},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2727999985218048},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.2696000039577484},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2696000039577484},{"id":"https://openalex.org/C80467683","wikidata":"https://www.wikidata.org/wiki/Q4997446","display_name":"Bunched logic","level":5,"score":0.2685000002384186},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.263700008392334},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.25699999928474426},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2556999921798706},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.2542000114917755}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3764117","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3764117","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3764117","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3764117","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3764117","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3764117","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3640164485","display_name":"FMitF: Track I: Principles for Modular Probabilistic Programming and Inference","funder_award_id":"2220408","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8182366192","display_name":null,"funder_award_id":"N66001-21-C-4023,HR00112590130","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320332815","display_name":"Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414977295.pdf","grobid_xml":"https://content.openalex.org/works/W4414977295.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W37142284","https://openalex.org/W1773735832","https://openalex.org/W2023035194","https://openalex.org/W2114834520","https://openalex.org/W2901454403","https://openalex.org/W2914920194","https://openalex.org/W2964755768","https://openalex.org/W2996725384","https://openalex.org/W3014933227","https://openalex.org/W3028779248","https://openalex.org/W3112414036","https://openalex.org/W4237884949","https://openalex.org/W4241006348","https://openalex.org/W4256135566","https://openalex.org/W4281974386","https://openalex.org/W4411267027","https://openalex.org/W4414977295"],"related_works":[],"abstract_inverted_index":{"Linear":[0],"type":[1,121,151],"systems":[2],"are":[3],"powerful":[4],"because":[5],"they":[6,18],"can":[7,19],"statically":[8],"ensure":[9],"the":[10,80,92,98,104,111,175,209],"correct":[11],"management":[12,128],"of":[13,30,82,103,113,177,194,212],"resources":[14],"like":[15],"memory,":[16],"but":[17,94,220],"also":[20,198],"be":[21,36],"cumbersome":[22],"to":[23,54,87,91,207],"work":[24],"with,":[25],"since":[26],"even":[27],"benign":[28],"uses":[29],"a":[31,83,118,166,181],"resource":[32,58,84],"require":[33],"that":[34,97,184,187,200,217],"it":[35,90,137],"explicitly":[37,88],"threaded":[38],"through":[39],"during":[40],"computation.":[41],"Borrowing":[42],",":[43],"as":[44],"popularized":[45],"by":[46,51,115],"Rust,":[47],"reduces":[48],"this":[49,77,107,178],"burden":[50],"allowing":[52],"one":[53],"temporarily":[55,218],"disable":[56],"certain":[57,68],"permissions":[59,70],"(e.g.,":[60,71],"deallocation":[61],"or":[62,73],"mutation)":[63],"in":[64,129],"exchange":[65],"for":[66,123,153,171],"enabling":[67],"structural":[69],"weakening":[72],"contraction).":[74],"In":[75,106],"particular,":[76],"mechanism":[78],"spares":[79],"borrower":[81],"from":[85],"having":[86],"return":[89],"lender":[93,99],"nevertheless":[95],"ensures":[96],"eventually":[100],"reclaims":[101],"ownership":[102],"resource.":[105],"paper,":[108],"we":[109],"elucidate":[110],"semantics":[112],"borrowing":[114],"starting":[116],"with":[117,138],"standard":[119],"linear":[120],"system":[122],"ensuring":[124],"safe":[125],"manual":[126],"memory":[127,195],"an":[130],"untyped":[131],"lambda":[132],"calculus":[133,189],"and":[134,144,192],"gradually":[135],"augmenting":[136],"immutable":[139],"borrows,":[140],"lexical":[141],"lifetimes,":[142],"reborrowing,":[143],"finally":[145],"mutable":[146],"borrows.":[147],"We":[148,173,197],"prove":[149],"semantic":[150,182,210],"soundness":[152,176],"our":[154,188,201],"Borrow":[155,161,202],"Calculus":[156],"(":[157,163],"BoCa":[158],")":[159],"using":[160,180],"Logic":[162,203],"BoLo":[164],"),":[165],"novel":[167],"domain-specific":[168],"separation":[169],"logic":[170,179],"borrowing.":[172],"establish":[174,208],"model":[183],"additionally":[185],"guarantees":[186],"is":[190,204],"terminating":[191],"free":[193],"leaks.":[196],"show":[199],"robust":[205],"enough":[206],"safety":[211],"some":[213],"syntactically":[214],"ill-typed":[215],"programs":[216],"break":[219],"reestablish":[221],"invariants.":[222]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}