{"id":"https://openalex.org/W4414967775","doi":"https://doi.org/10.46298/lmcs-21(4:5)2025","title":"What Monads Can and Cannot Do with a Few Extra Pages","display_name":"What Monads Can and Cannot Do with a Few Extra Pages","publication_year":2025,"publication_date":"2025-10-08","ids":{"openalex":"https://openalex.org/W4414967775","doi":"https://doi.org/10.46298/lmcs-21(4:5)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(4:5)2025","doi":"https://doi.org/10.46298/lmcs-21(4:5)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:5)2025","pdf_url":"https://lmcs.episciences.org/16664/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/16664/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045780288","display_name":"Rasmus Ejlers M\u00f8gelberg","orcid":"https://orcid.org/0000-0003-0386-4376","observed_orcids":["https://orcid.org/0000-0003-0386-4376"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rasmus Ejlers M\u00f8gelberg","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089927419","display_name":"Maaike Zwart","orcid":"https://orcid.org/0000-0002-0257-1574","observed_orcids":["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 Zwart","raw_affiliation_strings":["300 , San Francisco , CA 94105 , USA , or Eisenacher Strasse 2 , 10777 Berlin , Germany","IT University of Copenhagen , Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"300 , San Francisco , CA 94105 , USA , or Eisenacher Strasse 2 , 10777 Berlin , Germany","institution_ids":[]},{"raw_affiliation_string":"IT University of Copenhagen , Denmark","institution_ids":["https://openalex.org/I83467386"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4271,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.67097439,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"Volume 21, Issue 4","issue":null,"first_page":null,"last_page":null},"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.9994999766349792,"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.9994999766349792,"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":9.999999747378752e-05,"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/T11727","display_name":"Advanced Algebra and Logic","score":9.999999747378752e-05,"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/general-recursion","display_name":"general recursion","score":0.7480000257492065},{"id":"https://openalex.org/keywords/type-theory","display_name":"type theory","score":0.7680000066757202},{"id":"https://openalex.org/keywords/computational-effects","display_name":"computational effects","score":0.8690000176429749},{"id":"https://openalex.org/keywords/coinduction","display_name":"coinduction","score":0.7609999775886536},{"id":"https://openalex.org/keywords/guarded-recursion","display_name":"guarded recursion","score":0.9900000095367432},{"id":"https://openalex.org/keywords/distributivity","display_name":"distributivity","score":0.8240000009536743},{"id":"https://openalex.org/keywords/weak-bisimilarity","display_name":"weak bisimilarity","score":0.9490000009536743},{"id":"https://openalex.org/keywords/algebraic-effects","display_name":"algebraic effects","score":0.8999999761581421}],"concepts":[{"id":"https://openalex.org/C33959348","wikidata":"https://www.wikidata.org/wiki/Q1630568","display_name":"Monad (category theory)","level":3,"score":0.9652000069618225},{"id":"https://openalex.org/C40220748","wikidata":"https://www.wikidata.org/wiki/Q4227156","display_name":"Coinduction","level":3,"score":0.7458000183105469},{"id":"https://openalex.org/C11821877","wikidata":"https://www.wikidata.org/wiki/Q187959","display_name":"Distributive property","level":2,"score":0.6765999794006348},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.656499981880188},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6330999732017517},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.508400022983551},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.48399999737739563},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.45249998569488525},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.4505999982357025},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4336000084877014},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.39410001039505005},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34940001368522644},{"id":"https://openalex.org/C2780624054","wikidata":"https://www.wikidata.org/wiki/Q34010","display_name":"Haskell","level":3,"score":0.3407000005245209},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.328000009059906},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32739999890327454},{"id":"https://openalex.org/C20528804","wikidata":"https://www.wikidata.org/wiki/Q997433","display_name":"Dependent type","level":3,"score":0.3089999854564667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30820000171661377},{"id":"https://openalex.org/C2982832238","wikidata":"https://www.wikidata.org/wiki/Q5531640","display_name":"General purpose","level":2,"score":0.2526000142097473},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.251800000667572}],"mesh":[],"locations_count":11,"locations":[{"id":"doi:10.46298/lmcs-21(4:5)2025","doi":"https://doi.org/10.46298/lmcs-21(4:5)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:5)2025","pdf_url":"https://lmcs.episciences.org/16664/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/6156f58d-1608-4343-8792-47d1a33d86c8","doi":null,"is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/6156f58d-1608-4343-8792-47d1a33d86c8","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"M\u00f8gelberg, R E & Zwart, M A 2025, 'What Monads Can and Cannot Do with a Few Extra Pages', Logical Methods in Computer Science, vol. 21, no. 4. https://doi.org/10.46298/lmcs-21(4:5)2025","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:arXiv.org:2311.15919","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2311.15919","pdf_url":"https://arxiv.org/pdf/2311.15919","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:19682","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.39","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol288-csl2024/LIPIcs.CSL.2024.39/LIPIcs.CSL.2024.39.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"InProceedings"},{"id":"pmh:oai:pure.atira.dk:publications/5ffdfce1-f80f-404a-a106-0c9edc674b53","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2311.15919v1","pdf_url":"https://pure.itu.dk/ws/files/108622729/paper.pdf","source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"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":"M\u00f8gelberg, R E & Zwart, M A 2024, What Monads Can and Cannot Do with a Bit of Extra Time. in 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024) . vol. 288, 39, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, pp. 39:1--39:18. < https://arxiv.org/abs/2311.15919v1 >","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:doaj.org/article:9467720358a146e4bd7ecac3a1c43b4c","doi":null,"is_oa":false,"landing_page_url":"https://doaj.org/article/9467720358a146e4bd7ecac3a1c43b4c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 21, Issue 4 (2025)","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:datasets/f5987df0-a2e7-4215-b60c-1449262af3f3","doi":null,"is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/datasets/f5987df0-a2e7-4215-b60c-1449262af3f3","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"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":null,"raw_type":"Dataset"},{"id":"doi:10.48550/arxiv.2311.15919","doi":"https://doi.org/10.48550/arxiv.2311.15919","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2311.15919","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.csl.2024.39","doi":"https://doi.org/10.4230/lipics.csl.2024.39","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.csl.2024.39","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","jufo-1","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"doi:10.5281/zenodo.15593220","doi":"https://doi.org/10.5281/zenodo.15593220","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.15593220","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Software"},{"id":"doi:10.5281/zenodo.15593221","doi":"https://doi.org/10.5281/zenodo.15593221","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.15593221","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Software"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(4:5)2025","doi":"https://doi.org/10.46298/lmcs-21(4:5)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:5)2025","pdf_url":"https://lmcs.episciences.org/16664/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414967775.pdf","grobid_xml":"https://content.openalex.org/works/W4414967775.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"delay":[1,33,56,85],"monad":[2,34,57],"provides":[3],"a":[4,18,44],"way":[5],"to":[6,30,104],"introduce":[7],"general":[8,76],"recursion":[9],"in":[10,25],"type":[11,26],"theory.":[12],"To":[13],"write":[14],"programs":[15],"that":[16],"use":[17],"wide":[19],"range":[20],"of":[21,38,48,66,95],"computational":[22,71],"effects":[23,81],"directly":[24],"theory,":[27],"we":[28,42,92],"need":[29],"combine":[31],"the":[32,36,54,84,96],"with":[35,69],"monads":[37],"these":[39,68],"effects.":[40,72],"Here":[41],"present":[43],"first":[45],"systematic":[46],"study":[47,52],"such":[49],"combinations.":[50],"We":[51,73],"both":[53],"coinductive":[55],"and":[58,87],"its":[59],"guarded":[60],"recursive":[61],"cousin,":[62],"giving":[63],"concrete":[64],"examples":[65],"combining":[67],"well-known":[70],"also":[74],"provide":[75],"theorems":[77],"stating":[78],"which":[79,88],"algebraic":[80],"distribute":[82],"over":[83],"monad,":[86],"do":[89],"not.":[90],"Lastly,":[91],"salvage":[93],"some":[94],"impossible":[97],"cases":[98],"by":[99],"considering":[100],"distributive":[101],"laws":[102],"up":[103],"weak":[105],"bisimilarity.":[106]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-10-02T10:15:12.560889","created_date":"2025-10-10T00:00:00"}