{"id":"https://openalex.org/W4406221614","doi":"https://doi.org/10.1145/3704866","title":"A Modal Deconstruction of L\u00f6b Induction","display_name":"A Modal Deconstruction of L\u00f6b Induction","publication_year":2025,"publication_date":"2025-01-07","ids":{"openalex":"https://openalex.org/W4406221614","doi":"https://doi.org/10.1145/3704866"},"language":"en","primary_location":{"id":"doi:10.1145/3704866","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704866","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/3704866","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056800630","display_name":"Daniel Gratzer","orcid":"https://orcid.org/0000-0003-1944-0789"},"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":true,"raw_author_name":"Daniel Gratzer","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-1944-0789","affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056800630"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00181062,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":"POPL","first_page":"864","last_page":"892"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9796000123023987,"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.9610000252723694,"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/recursion","display_name":"Recursion (computer science)","score":0.730954110622406},{"id":"https://openalex.org/keywords/topos-theory","display_name":"Topos theory","score":0.6594289541244507},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.6120501756668091},{"id":"https://openalex.org/keywords/type-theory","display_name":"Type theory","score":0.5464316010475159},{"id":"https://openalex.org/keywords/normalization","display_name":"Normalization (sociology)","score":0.5416269302368164},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5328438878059387},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.36362549662590027},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35667356848716736},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3534460663795471},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3489651083946228},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.31950879096984863},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.262220561504364},{"id":"https://openalex.org/keywords/sociology","display_name":"Sociology","score":0.143472820520401},{"id":"https://openalex.org/keywords/literature","display_name":"Literature","score":0.08773767948150635},{"id":"https://openalex.org/keywords/art","display_name":"Art","score":0.07248961925506592}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.730954110622406},{"id":"https://openalex.org/C182141236","wikidata":"https://www.wikidata.org/wiki/Q2143621","display_name":"Topos theory","level":2,"score":0.6594289541244507},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.6120501756668091},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.5464316010475159},{"id":"https://openalex.org/C136886441","wikidata":"https://www.wikidata.org/wiki/Q926129","display_name":"Normalization (sociology)","level":2,"score":0.5416269302368164},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5328438878059387},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.36362549662590027},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35667356848716736},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3534460663795471},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3489651083946228},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.31950879096984863},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.262220561504364},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.143472820520401},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.08773767948150635},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.07248961925506592},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C19165224","wikidata":"https://www.wikidata.org/wiki/Q23404","display_name":"Anthropology","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3704866","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704866","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/26729ed2-b34a-48e0-a0dd-0d716aeed74b","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/26729ed2-b34a-48e0-a0dd-0d716aeed74b","pdf_url":"https://pure.au.dk/ws/files/470326223/A_Modal_Deconstruction_of_L_b_Induction.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Gratzer, D 2025, 'A Modal Deconstruction of L\u00f6b Induction', Proceedings of the ACM on Programming Languages , vol. 9, 30. https://doi.org/10.1145/3704866","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1145/3704866","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704866","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":[{"score":0.7300000190734863,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[{"id":"https://openalex.org/G6851704783","display_name":null,"funder_award_id":"25804","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"}],"funders":[{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W1969167499","https://openalex.org/W1984902166","https://openalex.org/W2020900140","https://openalex.org/W2023309117","https://openalex.org/W2030299533","https://openalex.org/W2098691999","https://openalex.org/W2116813111","https://openalex.org/W2165952355","https://openalex.org/W2182079433","https://openalex.org/W2245432137","https://openalex.org/W2293895310","https://openalex.org/W2500618074","https://openalex.org/W2528548943","https://openalex.org/W2530147817","https://openalex.org/W2743482027","https://openalex.org/W2784396204","https://openalex.org/W2796622197","https://openalex.org/W2798556801","https://openalex.org/W2899103964","https://openalex.org/W2962873201","https://openalex.org/W2964305797","https://openalex.org/W2966311659","https://openalex.org/W3002997625","https://openalex.org/W3003698201","https://openalex.org/W3022922601","https://openalex.org/W3030119148","https://openalex.org/W3101768401","https://openalex.org/W3103773646","https://openalex.org/W3105116513","https://openalex.org/W3115602736","https://openalex.org/W3141612224","https://openalex.org/W3168820674","https://openalex.org/W3175425481","https://openalex.org/W3175711391","https://openalex.org/W3188877929","https://openalex.org/W3191632648","https://openalex.org/W4200558465","https://openalex.org/W4315701979","https://openalex.org/W4321480377","https://openalex.org/W6608654543"],"related_works":["https://openalex.org/W4246327958","https://openalex.org/W2579704584","https://openalex.org/W3110986101","https://openalex.org/W4319982912","https://openalex.org/W4388322088","https://openalex.org/W2556917400","https://openalex.org/W2949083576","https://openalex.org/W1882235344","https://openalex.org/W2786712325","https://openalex.org/W2125274893"],"abstract_inverted_index":{"We":[0,39,72,94],"present":[1,46],"a":[2,31,103],"novel":[3],"analysis":[4],"of":[5,16,37,58,61,106,112],"the":[6,48,54,59,110],"fundamental":[7],"L\u00f6b":[8,28,64],"induction":[9,29,65],"principle":[10],"from":[11,30],"guarded":[12,50,82],"recursion.":[13],"Taking":[14],"advantage":[15],"recent":[17],"work":[18],"in":[19],"modal":[20,56],"type":[21,51],"theory":[22,52,111],"and":[23,33,84,100],"univalent":[24,107],"foundations,":[25],"we":[26],"derive":[27],"simpler":[32],"more":[34],"conceptual":[35],"set":[36],"primitives.":[38],"then":[40],"capitalize":[41],"on":[42,91,97],"these":[43],"insights":[44,99],"to":[45,81,89,109],"Gatsby,":[47],"first":[49],"capturing":[53],"rich":[55],"structure":[57],"topos":[60],"trees":[62],"alongside":[63],"without":[66],"immediately":[67],"precluding":[68],"canonicity":[69],"or":[70],"normalization.":[71],"show":[73],"that":[74],"Gatsby":[75,101],"can":[76],"recover":[77],"many":[78],"prior":[79,92],"approaches":[80],"recursion":[83],"use":[85],"its":[86],"additional":[87],"power":[88],"improve":[90],"examples.":[93],"crucially":[95],"rely":[96],"homotopical":[98],"constitutes":[102],"new":[104],"application":[105],"foundations":[108],"programming":[113],"languages.":[114]},"counts_by_year":[],"updated_date":"2026-09-01T08:31:24.195828","created_date":"2025-10-10T00:00:00"}