{"id":"https://openalex.org/W4406224192","doi":"https://doi.org/10.1145/3704884","title":"Modelling Recursion and Probabilistic Choice in Guarded Type Theory","display_name":"Modelling Recursion and Probabilistic Choice in Guarded Type Theory","publication_year":2025,"publication_date":"2025-01-07","ids":{"openalex":"https://openalex.org/W4406224192","doi":"https://doi.org/10.1145/3704884"},"language":"en","primary_location":{"id":"doi:10.1145/3704884","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704884","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":"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://doi.org/10.1145/3704884","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114483084","display_name":"Philipp Jan Andries Stassen","orcid":"https://orcid.org/0000-0003-4600-777X"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Philipp Stassen","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-4600-777X","affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045780288","display_name":"Rasmus Ejlers M\u00f8gelberg","orcid":"https://orcid.org/0000-0003-0386-4376"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Rasmus Ejlers M\u00f8gelberg","raw_affiliation_strings":["IT University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-0386-4376","affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089927419","display_name":"Maaike Zwart","orcid":"https://orcid.org/0000-0002-0257-1574"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Maaike Annebet Zwart","raw_affiliation_strings":["IT University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-0257-1574","affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073092626","display_name":"Alejandro Aguirre","orcid":"https://orcid.org/0000-0001-6746-2734"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Alejandro Aguirre","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-6746-2734","affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055959064","display_name":"Lars Birkedal","orcid":"https://orcid.org/0000-0003-1320-0098"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lars Birkedal","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-1320-0098","affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7588,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.84985255,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"9","issue":"POPL","first_page":"1417","last_page":"1445"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9901999831199646,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9901999831199646,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9865000247955322,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9677000045776367,"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/recursion","display_name":"Recursion (computer science)","score":0.8006589412689209},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6723312735557556},{"id":"https://openalex.org/keywords/type-theory","display_name":"Type theory","score":0.5872308611869812},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5721336603164673},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5285485982894897},{"id":"https://openalex.org/keywords/mutual-recursion","display_name":"Mutual recursion","score":0.46753475069999695},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3829418122768402},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.36773359775543213},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3485816717147827},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2773357331752777},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23259124159812927},{"id":"https://openalex.org/keywords/geology","display_name":"Geology","score":0.0855233371257782}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8006589412689209},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6723312735557556},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.5872308611869812},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5721336603164673},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5285485982894897},{"id":"https://openalex.org/C124416688","wikidata":"https://www.wikidata.org/wiki/Q3454656","display_name":"Mutual recursion","level":3,"score":0.46753475069999695},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3829418122768402},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.36773359775543213},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3485816717147827},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2773357331752777},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23259124159812927},{"id":"https://openalex.org/C127313418","wikidata":"https://www.wikidata.org/wiki/Q1069","display_name":"Geology","level":0,"score":0.0855233371257782},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3704884","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704884","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":"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:pure.atira.dk:openaire/d5998eec-e914-4bfa-891b-ff8506bad04a","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/d5998eec-e914-4bfa-891b-ff8506bad04a","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Stassen, P, M\u00f8gelberg, R E, Zwart, M A, Aguirre, A & Birkedal, L 2025, 'Modelling Recursion and Probabilistic Choice in Guarded Type Theory', Proceedings of the ACM on Programming Languages , vol. 9, no. POPL, 48, pp. 1417-1445. https://doi.org/10.1145/3704884","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/d5998eec-e914-4bfa-891b-ff8506bad04a","is_oa":true,"landing_page_url":"https://www.scopus.com/pages/publications/85215684518","pdf_url":null,"source":{"id":"https://openalex.org/S4306400063","display_name":"Scopus (Elsevier)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Stassen, P, M\u00f8gelberg, R E, Zwart, M A, Aguirre, A & Birkedal, L 2025, 'Modelling Recursion and Probabilistic Choice in Guarded Type Theory', Proceedings of the ACM on Programming Languages , vol. 9, no. POPL, 48, pp. 1417-1445. https://doi.org/10.1145/3704884","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1145/3704884","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704884","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":"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/G5961606246","display_name":null,"funder_award_id":"101096090","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G6851704783","display_name":null,"funder_award_id":"25804","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"},{"id":"https://openalex.org/G899382969","display_name":"Compositional Higher-Order Reasoning about Distributed Systems","funder_award_id":"101096090","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W58003850","https://openalex.org/W136487247","https://openalex.org/W385466589","https://openalex.org/W1969167499","https://openalex.org/W1984902166","https://openalex.org/W2011086847","https://openalex.org/W2035063966","https://openalex.org/W2060852846","https://openalex.org/W2113123008","https://openalex.org/W2132181573","https://openalex.org/W2153644103","https://openalex.org/W2155748644","https://openalex.org/W2182079433","https://openalex.org/W2228964661","https://openalex.org/W2249132795","https://openalex.org/W2597297629","https://openalex.org/W2743482027","https://openalex.org/W2765937481","https://openalex.org/W2788983559","https://openalex.org/W2796622197","https://openalex.org/W2803229276","https://openalex.org/W2900404128","https://openalex.org/W2912723978","https://openalex.org/W2949151551","https://openalex.org/W2963573740","https://openalex.org/W2964835846","https://openalex.org/W2994797498","https://openalex.org/W2995075587","https://openalex.org/W3104323500","https://openalex.org/W3105116513","https://openalex.org/W3106280144","https://openalex.org/W3124307800","https://openalex.org/W3191632648","https://openalex.org/W4200558465","https://openalex.org/W4205512329","https://openalex.org/W4214593142","https://openalex.org/W4230556510","https://openalex.org/W4303437842","https://openalex.org/W4309131240","https://openalex.org/W4315606535","https://openalex.org/W4318145701","https://openalex.org/W4385474333","https://openalex.org/W4389116474","https://openalex.org/W4390605452","https://openalex.org/W4406221968"],"related_works":["https://openalex.org/W2006836388","https://openalex.org/W1563586960","https://openalex.org/W2044963554","https://openalex.org/W2374742784","https://openalex.org/W2155605358","https://openalex.org/W3161063338","https://openalex.org/W2073366168","https://openalex.org/W2171568718","https://openalex.org/W2786712325","https://openalex.org/W2125274893"],"abstract_inverted_index":{"Constructive":[0],"type":[1,20,32,65,89],"theory":[2],"combines":[3],"logic":[4],"and":[5,49,72,84,100,110],"programming":[6,29,79],"in":[7,19,63,87],"one":[8],"language.":[9],"This":[10],"is":[11,35,39],"useful":[12],"both":[13,108],"for":[14,25],"reasoning":[15,26],"about":[16,27,74,143],"programs":[17,144],"written":[18],"theory,":[21],"as":[22,24,53,117,119],"well":[23,118],"other":[28],"languages":[30,46],"inside":[31],"theory.":[33,66,90],"It":[34],"well-known":[36],"that":[37],"it":[38,140],"challenging":[40],"to":[41,45,70,96,103,130,138,141,146],"extend":[42],"these":[43,57],"applications":[44],"with":[47,81],"recursion":[48,102],"computational":[50],"effects":[51],"such":[52],"probabilistic":[54,82],"choice,":[55],"because":[56],"features":[58],"are":[59],"not":[60],"easily":[61],"represented":[62],"constructive":[64],"We":[67,91,106],"show":[68,136],"how":[69,137],"define":[71,107],"reason":[73,142],"FPC":[75,114],"\u2295":[76,115],",":[77,116],"a":[78,120],"language":[80],"choice":[83],"recursive":[85],"types,":[86],"guarded":[88,101],"use":[92,139],"higher":[93],"inductive":[94],"types":[95],"represent":[97],"finite":[98],"distributions":[99],"model":[104],"recursion.":[105],"operational":[109],"denotational":[111],"semantics":[112],"of":[113],"relation":[121,126],"between":[122],"the":[123],"two.":[124],"The":[125],"can":[127],"be":[128],"used":[129],"prove":[131],"adequacy,":[132],"but":[133],"we":[134],"also":[135],"up":[145],"contextual":[147],"equivalence.":[148]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}