{"id":"https://openalex.org/W4414988633","doi":"https://doi.org/10.1145/3763116","title":"Modeling Reachability Types with Logical Relations: Semantic Type Soundness, Termination, Effect Safety, and Equational Theory","display_name":"Modeling Reachability Types with Logical Relations: Semantic Type Soundness, Termination, Effect Safety, and Equational Theory","publication_year":2025,"publication_date":"2025-10-09","ids":{"openalex":"https://openalex.org/W4414988633","doi":"https://doi.org/10.1145/3763116"},"language":"en","primary_location":{"id":"doi:10.1145/3763116","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3763116","pdf_url":null,"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":null,"license_id":null,"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://doi.org/10.1145/3763116","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056854451","display_name":"Yuyan Bao","orcid":"https://orcid.org/0000-0002-3832-3134"},"institutions":[{"id":"https://openalex.org/I25041050","display_name":"Augusta University","ror":"https://ror.org/012mef835","country_code":"US","type":"education","lineage":["https://openalex.org/I25041050"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuyan Bao","raw_affiliation_strings":["Augusta University, Augusta, USA"],"raw_orcid":"https://orcid.org/0000-0002-3832-3134","affiliations":[{"raw_affiliation_string":"Augusta University, Augusta, USA","institution_ids":["https://openalex.org/I25041050"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077076536","display_name":"Songlin Jia","orcid":"https://orcid.org/0009-0008-2526-0438"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Songlin Jia","raw_affiliation_strings":["Purdue University, West Lafayette, USA"],"raw_orcid":"https://orcid.org/0009-0008-2526-0438","affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054308182","display_name":"Guannan Wei","orcid":"https://orcid.org/0000-0002-3150-2033"},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guannan Wei","raw_affiliation_strings":["Tufts University, Medford and Somerville, USA"],"raw_orcid":"https://orcid.org/0000-0002-3150-2033","affiliations":[{"raw_affiliation_string":"Tufts University, Medford and Somerville, USA","institution_ids":["https://openalex.org/I121934306"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019063975","display_name":"Oliver Bra\u010devac","orcid":"https://orcid.org/0000-0003-3569-4869"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Oliver Bra\u010devac","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"raw_orcid":"https://orcid.org/0000-0003-3569-4869","affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003153354","display_name":"Tiark Rompf","orcid":"https://orcid.org/0000-0002-2068-3238"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tiark Rompf","raw_affiliation_strings":["Purdue University, West Lafayette, USA"],"raw_orcid":"https://orcid.org/0000-0002-2068-3238","affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.5175,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.93522658,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"9","issue":"OOPSLA2","first_page":"1837","last_page":"1864"},"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.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"}},"topics":[{"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/T10142","display_name":"Formal Methods in Verification","score":0.9962999820709229,"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.9962000250816345,"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.842199981212616},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8070999979972839},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5993000268936157},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5734000205993652},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4860999882221222},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.48100000619888306},{"id":"https://openalex.org/keywords/type-theory","display_name":"Type theory","score":0.46059998869895935},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.43230000138282776},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.4318999946117401},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.41990000009536743}],"concepts":[{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.842199981212616},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8070999979972839},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7760999798774719},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6216999888420105},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5993000268936157},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5734000205993652},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5519999861717224},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4860999882221222},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.48100000619888306},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.46059998869895935},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.43230000138282776},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.4318999946117401},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.41990000009536743},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.40369999408721924},{"id":"https://openalex.org/C20528804","wikidata":"https://www.wikidata.org/wiki/Q997433","display_name":"Dependent type","level":3,"score":0.3677999973297119},{"id":"https://openalex.org/C138958017","wikidata":"https://www.wikidata.org/wiki/Q190087","display_name":"Data type","level":2,"score":0.3449999988079071},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.33980000019073486},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.32710000872612},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.32109999656677246},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.3181000053882599},{"id":"https://openalex.org/C198942812","wikidata":"https://www.wikidata.org/wiki/Q496618","display_name":"Semantic property","level":2,"score":0.31679999828338623},{"id":"https://openalex.org/C32848918","wikidata":"https://www.wikidata.org/wiki/Q845789","display_name":"Observable","level":2,"score":0.30000001192092896},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.28859999775886536},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2842999994754791},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28209999203681946},{"id":"https://openalex.org/C200833197","wikidata":"https://www.wikidata.org/wiki/Q333707","display_name":"Compile time","level":3,"score":0.2818000018596649},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.2721000015735626},{"id":"https://openalex.org/C2778790839","wikidata":"https://www.wikidata.org/wiki/Q6667497","display_name":"Logical form","level":2,"score":0.2678000032901764},{"id":"https://openalex.org/C121375916","wikidata":"https://www.wikidata.org/wiki/Q936559","display_name":"Principle of compositionality","level":2,"score":0.2635999917984009},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C90312973","wikidata":"https://www.wikidata.org/wiki/Q7449052","display_name":"Semantic data model","level":2,"score":0.25850000977516174},{"id":"https://openalex.org/C20693621","wikidata":"https://www.wikidata.org/wiki/Q6667502","display_name":"Logical framework","level":2,"score":0.25360000133514404}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3763116","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3763116","pdf_url":null,"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":null,"license_id":null,"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/3763116","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3763116","pdf_url":null,"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":null,"license_id":null,"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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W1495368328","https://openalex.org/W1508098446","https://openalex.org/W1552367747","https://openalex.org/W1553136405","https://openalex.org/W1980939032","https://openalex.org/W1991984504","https://openalex.org/W2013892605","https://openalex.org/W2049984112","https://openalex.org/W2057779758","https://openalex.org/W2073407646","https://openalex.org/W2076954302","https://openalex.org/W2077987280","https://openalex.org/W2100559921","https://openalex.org/W2113757735","https://openalex.org/W2114834520","https://openalex.org/W2133455247","https://openalex.org/W2135620953","https://openalex.org/W2136839747","https://openalex.org/W2137628566","https://openalex.org/W2138527110","https://openalex.org/W2147323041","https://openalex.org/W2149837936","https://openalex.org/W2150922760","https://openalex.org/W2155656276","https://openalex.org/W2167696897","https://openalex.org/W2251459796","https://openalex.org/W2264026157","https://openalex.org/W2289066165","https://openalex.org/W2345944815","https://openalex.org/W2461817804","https://openalex.org/W2509578035","https://openalex.org/W2536396847","https://openalex.org/W2560908054","https://openalex.org/W2596377803","https://openalex.org/W2726198233","https://openalex.org/W2776685097","https://openalex.org/W2779850521","https://openalex.org/W2900040591","https://openalex.org/W2901454403","https://openalex.org/W2963105536","https://openalex.org/W2964755768","https://openalex.org/W3117045059","https://openalex.org/W3205248599","https://openalex.org/W4234270404","https://openalex.org/W4241045451","https://openalex.org/W4244977193","https://openalex.org/W4251064070","https://openalex.org/W4307731791","https://openalex.org/W4385889898","https://openalex.org/W4386711821","https://openalex.org/W4387667131","https://openalex.org/W4390605114","https://openalex.org/W4396214269","https://openalex.org/W4400499766","https://openalex.org/W4414977231","https://openalex.org/W7077276631"],"related_works":[],"abstract_inverted_index":{"Reachability":[0],"types":[1,53,80],"are":[2,31],"a":[3,17,85],"recent":[4],"proposal":[5],"to":[6,13],"bring":[7],"Rust-style":[8],"reasoning":[9],"about":[10],"memory":[11],"properties":[12,65,92],"higher-level":[14],"languages,":[15],"with":[16],"focus":[18],"on":[19],"higher-order":[20,113],"functions,":[21],"parametric":[22],"types,":[23],"and":[24,61],"shared":[25],"mutable":[26,114],"state":[27],"--":[28],"features":[29],"that":[30],"only":[32],"partially":[33],"supported":[34],"by":[35],"current":[36],"techniques":[37,58],"as":[38],"employed":[39],"in":[40,87,109],"Rust.":[41],"While":[42],"prior":[43],"work":[44],"has":[45],"established":[46],"key":[47,91],"type":[48,97],"soundness":[49],"results":[50],"for":[51,135],"reachability":[52,79],"using":[54,81],"the":[55,110,120],"usual":[56],"syntactic":[57],"of":[59,78,93,100,112,122,132],"progress":[60],"preservation,":[62],"stronger":[63],"metatheoretic":[64],"have":[66],"so":[67],"far":[68],"been":[69],"unexplored.":[70],"This":[71],"paper":[72],"presents":[73],"an":[74],"alternative":[75],"semantic":[76,96],"model":[77],"logical":[82],"relations,":[83],"providing":[84],"framework":[86],"which":[88],"we":[89],"study":[90],"interest:":[94],"(1)":[95],"soundness,":[98],"including":[99],"not":[101],"syntactically":[102],"well-typed":[103],"code":[104],"fragments,":[105],"(2)":[106],"termination,":[107],"especially":[108,119,130],"presence":[111],"references,":[115],"(3)":[116],"effect":[117],"safety,":[118],"absence":[121],"observable":[123],"mutation,":[124],"and,":[125],"finally,":[126],"(4)":[127],"program":[128],"equivalence,":[129],"reordering":[131],"non-interfering":[133],"expressions":[134],"parallelization":[136],"or":[137],"compiler":[138],"optimization.":[139]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}