{"id":"https://openalex.org/W2965839166","doi":"https://doi.org/10.1109/lics.2019.8785725","title":"Type-Based Complexity Analysis of Probabilistic Functional Programs","display_name":"Type-Based Complexity Analysis of Probabilistic Functional Programs","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2965839166","doi":"https://doi.org/10.1109/lics.2019.8785725","mag":"2965839166"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2019.8785725","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785725","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-02381829/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048841494","display_name":"Martin Avanzini","orcid":"https://orcid.org/0000-0002-6445-8833"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210106545","display_name":"Centre Inria d'Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/01nzkaw91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I201841394","https://openalex.org/I4210106545"]},{"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":["FR","IT"],"is_corresponding":false,"raw_author_name":"Martin Avanzini","raw_affiliation_strings":["INRIA Sophia, Antipolis","FOCUS - Foundations of Component-based Ubiquitous Systems (Dipartimento di Informatica - Scienza e Ingegneria (DISI)\r\nUniversita' di Bologna\r\nMura Anteo Zamboni, 7\r\n40126 Bologna\r\nITALY - Italy)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Sophia, Antipolis","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210106545"]},{"raw_affiliation_string":"FOCUS - Foundations of Component-based Ubiquitous Systems (Dipartimento di Informatica - Scienza e Ingegneria (DISI)\r\nUniversita' di Bologna\r\nMura Anteo Zamboni, 7\r\n40126 Bologna\r\nITALY - Italy)","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084450516","display_name":"Ugo Dal Lago","orcid":"https://orcid.org/0000-0001-9200-070X"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"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":["FR","IT"],"is_corresponding":false,"raw_author_name":"Ugo Dal Lago","raw_affiliation_strings":["University of Bologna & INRIA Sophia, Antipolis","FOCUS - Foundations of Component-based Ubiquitous Systems (Dipartimento di Informatica - Scienza e Ingegneria (DISI)\r\nUniversita' di Bologna\r\nMura Anteo Zamboni, 7\r\n40126 Bologna\r\nITALY - Italy)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bologna & INRIA Sophia, Antipolis","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I9360294"]},{"raw_affiliation_string":"FOCUS - Foundations of Component-based Ubiquitous Systems (Dipartimento di Informatica - Scienza e Ingegneria (DISI)\r\nUniversita' di Bologna\r\nMura Anteo Zamboni, 7\r\n40126 Bologna\r\nITALY - Italy)","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019864338","display_name":"Alexis Ghyselen","orcid":"https://orcid.org/0000-0001-9767-2011"},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Alexis Ghyselen","raw_affiliation_strings":["EnsL, Univ Lyon","ENS de Lyon - \u00c9cole normale sup\u00e9rieure de Lyon (15 parvis Ren\u00e9 Descartes - BP 7000 - 69342 Lyon Cedex 07 - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EnsL, Univ Lyon","institution_ids":["https://openalex.org/I100532134"]},{"raw_affiliation_string":"ENS de Lyon - \u00c9cole normale sup\u00e9rieure de Lyon (15 parvis Ren\u00e9 Descartes - BP 7000 - 69342 Lyon Cedex 07 - France)","institution_ids":["https://openalex.org/I113428412"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2687,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":{"value":0.85108769,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"13"},"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.9993000030517578,"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.9993000030517578,"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.9988999962806702,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9980999827384949,"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/computer-science","display_name":"Computer science","score":0.7627997398376465},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7110305428504944},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5724599361419678},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5413299798965454},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.5295162200927734},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4873298108577728},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.44922935962677},{"id":"https://openalex.org/keywords/abstract-interpretation","display_name":"Abstract interpretation","score":0.4435931444168091},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4332921504974365},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4287130832672119},{"id":"https://openalex.org/keywords/subtyping","display_name":"Subtyping","score":0.42837560176849365},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.41611433029174805},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17478150129318237}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7627997398376465},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7110305428504944},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5724599361419678},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5413299798965454},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.5295162200927734},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4873298108577728},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.44922935962677},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.4435931444168091},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4332921504974365},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4287130832672119},{"id":"https://openalex.org/C83852419","wikidata":"https://www.wikidata.org/wiki/Q2713292","display_name":"Subtyping","level":2,"score":0.42837560176849365},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.41611433029174805},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17478150129318237},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/lics.2019.8785725","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785725","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-02381829v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-02381829","pdf_url":"https://inria.hal.science/hal-02381829/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":"LICS 2019 - 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1-13, &#x27E8;10.1109/LICS.2019.8785725&#x27E9;","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:cris.unibo.it:11585/718441","is_oa":false,"landing_page_url":"http://hdl.handle.net/11585/718441","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-02381829v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-02381829","pdf_url":"https://inria.hal.science/hal-02381829/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":"LICS 2019 - 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1-13, &#x27E8;10.1109/LICS.2019.8785725&#x27E9;","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3584739849","display_name":"Community of mathematics and fundamental computer science in Lyon","funder_award_id":"ANR-10-LABX-0070","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G5749889441","display_name":"Expanding Logical Ideas for Complexity Analysis","funder_award_id":"ANR-14-CE25-0005","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G7240651115","display_name":null,"funder_award_id":"ANR-10","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320313934","display_name":"Institut national de recherche en informatique et en automatique (INRIA)","ror":"https://ror.org/02kvxyf05"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2965839166.pdf","grobid_xml":"https://content.openalex.org/works/W2965839166.grobid-xml"},"referenced_works_count":57,"referenced_works":["https://openalex.org/W72346910","https://openalex.org/W1520619861","https://openalex.org/W1535793628","https://openalex.org/W1544023751","https://openalex.org/W1574901103","https://openalex.org/W1586173270","https://openalex.org/W1595409123","https://openalex.org/W1595989212","https://openalex.org/W1890754682","https://openalex.org/W1891319242","https://openalex.org/W1966928697","https://openalex.org/W1970227944","https://openalex.org/W1975575519","https://openalex.org/W1998777945","https://openalex.org/W2007270285","https://openalex.org/W2011086847","https://openalex.org/W2040622094","https://openalex.org/W2045812729","https://openalex.org/W2071592032","https://openalex.org/W2095867533","https://openalex.org/W2101085206","https://openalex.org/W2101931139","https://openalex.org/W2112969535","https://openalex.org/W2123991163","https://openalex.org/W2159080219","https://openalex.org/W2159341052","https://openalex.org/W2166496828","https://openalex.org/W2171496589","https://openalex.org/W2222812367","https://openalex.org/W2233431969","https://openalex.org/W2295428206","https://openalex.org/W2435583538","https://openalex.org/W2502507885","https://openalex.org/W2502685258","https://openalex.org/W2548604229","https://openalex.org/W2596582120","https://openalex.org/W2768683713","https://openalex.org/W2788405769","https://openalex.org/W2885708795","https://openalex.org/W2899702797","https://openalex.org/W2964032597","https://openalex.org/W2964180318","https://openalex.org/W2982085742","https://openalex.org/W3100368036","https://openalex.org/W3106186972","https://openalex.org/W4231916799","https://openalex.org/W4234891673","https://openalex.org/W4235295823","https://openalex.org/W4390855569","https://openalex.org/W6602924617","https://openalex.org/W6634982934","https://openalex.org/W6635829549","https://openalex.org/W6639796194","https://openalex.org/W6653081447","https://openalex.org/W6748422331","https://openalex.org/W6754063332","https://openalex.org/W6860460451"],"related_works":["https://openalex.org/W2396009657","https://openalex.org/W2799110842","https://openalex.org/W3032826521","https://openalex.org/W2391332606","https://openalex.org/W1462775415","https://openalex.org/W4229853287","https://openalex.org/W1535483699","https://openalex.org/W1967226206","https://openalex.org/W1579640669","https://openalex.org/W2529002779"],"abstract_inverted_index":{"We":[0,70],"show":[1],"that":[2,74,92,100],"complexity":[3,88],"analysis":[4],"of":[5,17,29,38,45,66],"probabilistic":[6,39],"higher-order":[7],"functional":[8],"programs":[9],"can":[10,107],"be":[11,108],"carried":[12],"out":[13],"compositionally":[14],"by":[15,64],"way":[16,65],"a":[18,26,43,51,82,111],"type":[19,23,77],"system.":[20],"The":[21],"introduced":[22],"system":[24],"is":[25,94],"significant":[27],"extension":[28],"refinement":[30],"types.":[31],"On":[32,55],"the":[33,36,56,75,98],"one":[34],"hand,":[35,58],"presence":[37],"effects":[40],"requires":[41],"adopting":[42],"form":[44],"dynamic":[46],"distribution":[47],"type,":[48],"subject":[49],"to":[50],"coupling-based":[52],"subtyping":[53],"discipline.":[54],"other":[57],"recursive":[59],"definitions":[60],"are":[61],"proved":[62],"terminating":[63],"Lyapunov":[67],"ranking":[68],"functions.":[69],"prove":[71],"not":[72],"only":[73],"obtained":[76],"system,":[78],"called":[79],"l\\pmbRPCF,":[80],"provides":[81],"sound":[83],"methodology":[84],"for":[85],"average":[86,102],"case":[87,103],"analysis,":[89],"but":[90],"also":[91],"it":[93],"extensionally":[95],"complete,":[96],"in":[97,114],"sense":[99],"any":[101],"nolytime":[104],"Turing":[105],"machines":[106],"encoded":[109],"as":[110],"term":[112],"typable":[113],"l\\pmbRPCF.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2019-08-13T00:00:00"}
