{"id":"https://openalex.org/W3093678001","doi":"https://doi.org/10.1145/3434313","title":"Intersection types and (positive) almost-sure termination","display_name":"Intersection types and (positive) almost-sure termination","publication_year":2021,"publication_date":"2021-01-04","ids":{"openalex":"https://openalex.org/W3093678001","doi":"https://doi.org/10.1145/3434313","mag":"3093678001"},"language":"en","primary_location":{"id":"doi:10.1145/3434313","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3434313","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3434313","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3434313","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ugo Dal Lago","orcid":"https://orcid.org/0000-0001-9200-070X"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Ugo Dal Lago","raw_affiliation_strings":["University of Bologna, Italy"],"raw_orcid":"https://orcid.org/0000-0001-9200-070X","affiliations":[{"raw_affiliation_string":"University of Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Claudia Faggian","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I4210117673","display_name":"Institut de Recherche en Informatique Fondamentale","ror":"https://ror.org/02krdtz55","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210089394","https://openalex.org/I4210117673","https://openalex.org/I4210139971"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Claudia Faggian","raw_affiliation_strings":["University of Paris, France / IRIF, France / CNRS, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Paris, France / IRIF, France / CNRS, France","institution_ids":["https://openalex.org/I4210117673","https://openalex.org/I204730241","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":null,"display_name":"Simona Ronchi Della Rocca","orcid":null},"institutions":[{"id":"https://openalex.org/I55143463","display_name":"University of Turin","ror":"https://ror.org/048tbm396","country_code":"IT","type":"education","lineage":["https://openalex.org/I55143463"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Simona Ronchi Della Rocca","raw_affiliation_strings":["University of Turin, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Turin, Italy","institution_ids":["https://openalex.org/I55143463"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3783,"has_fulltext":true,"cited_by_count":21,"citation_normalized_percentile":{"value":0.90254752,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"5","issue":"POPL","first_page":"1","last_page":"32"},"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.7609999775886536,"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.7609999775886536,"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.06620000302791595,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.04190000146627426,"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/reachability","display_name":"Reachability","score":0.6570000052452087},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5982999801635742},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5965999960899353},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.5479999780654907},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5327000021934509},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.5266000032424927},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.4503999948501587},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.44769999384880066},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.43619999289512634}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6784999966621399},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6570000052452087},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5982999801635742},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5965999960899353},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.5479999780654907},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5327000021934509},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.5266000032424927},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4738999903202057},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.4503999948501587},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.44769999384880066},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.43619999289512634},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4156999886035919},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.3894999921321869},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.37529999017715454},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.37439998984336853},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3643999993801117},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.3151000142097473},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.30489999055862427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3000999987125397},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.2976999878883362},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.28220000863075256},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.2736000120639801},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.2720000147819519},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26409998536109924},{"id":"https://openalex.org/C21031990","wikidata":"https://www.wikidata.org/wiki/Q355020","display_name":"Probability measure","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.2574999928474426},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2515999972820282}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3434313","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3434313","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3434313","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"},{"id":"pmh:oai:arXiv.org:2010.12689","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2010.12689","pdf_url":"https://arxiv.org/pdf/2010.12689","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-03044416v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03044416","pdf_url":"https://hal.science/hal-03044416v1/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the ACM on Programming Languages, 2021, ⟨10.1145/3434313⟩","raw_type":"Journal articles"},{"id":"pmh:oai:cris.unibo.it:11585/834265","is_oa":true,"landing_page_url":"http://hdl.handle.net/11585/834265","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1145/3434313","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3434313","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3434313","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/G2233425273","display_name":"Probabilistic program semantics","funder_award_id":"ANR-19-CE48-0014","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G4057764343","display_name":null,"funder_award_id":"818616","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G557875060","display_name":null,"funder_award_id":"201784YSZ5","funder_id":"https://openalex.org/F4320321873","funder_display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca"},{"id":"https://openalex.org/G8266173377","display_name":null,"funder_award_id":"19-CE48-0014","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G8318455765","display_name":null,"funder_award_id":"ANR-19","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320321873","display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","ror":"https://ror.org/0166hxq48"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3093678001.pdf","grobid_xml":"https://content.openalex.org/works/W3093678001.grobid-xml"},"referenced_works_count":57,"referenced_works":["https://openalex.org/W89746087","https://openalex.org/W1499878068","https://openalex.org/W1503480448","https://openalex.org/W1541300975","https://openalex.org/W1583851197","https://openalex.org/W1589550381","https://openalex.org/W1734364899","https://openalex.org/W1891319242","https://openalex.org/W1963705166","https://openalex.org/W1966928697","https://openalex.org/W1970227944","https://openalex.org/W1975447428","https://openalex.org/W1979206410","https://openalex.org/W1981303668","https://openalex.org/W2001822718","https://openalex.org/W2002689571","https://openalex.org/W2005059149","https://openalex.org/W2009311190","https://openalex.org/W2018802955","https://openalex.org/W2024355065","https://openalex.org/W2025341469","https://openalex.org/W2033104047","https://openalex.org/W2035063966","https://openalex.org/W2043646456","https://openalex.org/W2048999490","https://openalex.org/W2059442002","https://openalex.org/W2072881702","https://openalex.org/W2085670481","https://openalex.org/W2088735483","https://openalex.org/W2119240423","https://openalex.org/W2134918221","https://openalex.org/W2138308600","https://openalex.org/W2141505892","https://openalex.org/W2155748644","https://openalex.org/W2166496828","https://openalex.org/W2171496589","https://openalex.org/W2211325406","https://openalex.org/W2249132795","https://openalex.org/W2334782222","https://openalex.org/W2503383364","https://openalex.org/W2580225501","https://openalex.org/W2768683713","https://openalex.org/W2803490327","https://openalex.org/W2885708795","https://openalex.org/W2893610333","https://openalex.org/W2911921619","https://openalex.org/W2921909284","https://openalex.org/W2933535240","https://openalex.org/W2964032597","https://openalex.org/W2965667013","https://openalex.org/W2965839166","https://openalex.org/W2982085742","https://openalex.org/W4210300416","https://openalex.org/W4212875940","https://openalex.org/W4231916799","https://openalex.org/W4233636389","https://openalex.org/W4234891673"],"related_works":[],"abstract_inverted_index":{"Randomized":[0],"higher-order":[1],"computation":[2],"can":[3,60,122,206],"be":[4,61,123,168,197],"seen":[5],"as":[6],"being":[7],"captured":[8],"by":[9,125],"a":[10,14,19,89,110,135],"\u03bb-calculus":[11],"endowed":[12],"with":[13],"single":[15,111],"algebraic":[16],"operation,":[17],"namely":[18],"construct":[20],"for":[21],"binary":[22],"probabilistic":[23],"choice.":[24],"What":[25],"matters":[26],"about":[27,74,80],"such":[28],"computations":[29],"is":[30,162,194],"the":[31,40,43,54,75,81,85,115,130,139,173,188],"probability":[32,76,116],"of":[33,45,57,77,102,107,113,117,119,143,176,190],"obtaining":[34,46],"any":[35,120,185],"given":[36],"result,":[37],"rather":[38],"than":[39,209],"possibility":[41],"or":[42,79],"necessity":[44],"it,":[47],"like":[48],"in":[49,64],"(non)deterministic":[50],"computation.":[51],"Termination,":[52],"arguably":[53],"simplest":[55],"kind":[56,189],"reachability":[58],"problem,":[59],"spelled":[62],"out":[63],"at":[65],"least":[66],"two":[67],"ways,":[68],"depending":[69],"on":[70,172],"whether":[71],"it":[72,166],"talks":[73],"convergence":[78,118],"expected":[82,141,174],"evaluation":[83],"time,":[84],"second":[86],"one":[87],"providing":[88],"stronger":[90],"guarantee.":[91],"In":[92],"this":[93],"paper,":[94],"we":[95,192],"show":[96],"that":[97],"intersection":[98],"types":[99],"are":[100,151,180],"capable":[101],"precisely":[103],"characterizing":[104],"both":[105,149],"notions":[106],"termination":[108],"inside":[109],"system":[112,205],"types:":[114],"\u03bb-term":[121],"underapproximated":[124],"its":[126],"type":[127],",":[128],"while":[129],"underlying":[131],"derivation\u2019s":[132],"weight":[133],"gives":[134],"lower":[136],"bound":[137],"to":[138,145,170,182,196],"term\u2019s":[140],"number":[142,175],"steps":[144,178],"normal":[146],"form.":[147],"Noticeably,":[148],"approximations":[150],"tight\u2014not":[152],"only":[153],"soundness":[154],"but":[155],"also":[156],"completeness":[157],"holds.":[158],"The":[159],"crucial":[160],"ingredient":[161],"non-idempotency,":[163],"without":[164],"which":[165,179],"would":[167],"impossible":[169],"reason":[171],"reduction":[177],"necessary":[181],"completely":[183],"evaluate":[184],"term.":[186],"Besides,":[187],"approximation":[191],"obtain":[193],"proved":[195],"optimal":[198],"recursion":[199],"theoretically:":[200],"no":[201],"recursively":[202],"enumerable":[203],"formal":[204],"do":[207],"better":[208],"that.":[210]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5}],"updated_date":"2026-06-22T08:00:12.763002","created_date":"2020-10-29T00:00:00"}