{"id":"https://openalex.org/W4406221997","doi":"https://doi.org/10.1145/3704892","title":"Formalising Graph Algorithms with Coinduction","display_name":"Formalising Graph Algorithms with Coinduction","publication_year":2025,"publication_date":"2025-01-07","ids":{"openalex":"https://openalex.org/W4406221997","doi":"https://doi.org/10.1145/3704892"},"language":"en","primary_location":{"id":"doi:10.1145/3704892","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704892","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/3704892","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049439648","display_name":"Donnacha Ois\u00edn Kidney","orcid":"https://orcid.org/0000-0003-4952-7359"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Donnacha Ois\u00edn Kidney","raw_affiliation_strings":["Imperial College London, London, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0003-4952-7359","affiliations":[{"raw_affiliation_string":"Imperial College London, London, United Kingdom","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072641397","display_name":"Nicolas Wu","orcid":"https://orcid.org/0000-0002-4161-985X"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nicolas Wu","raw_affiliation_strings":["Imperial College London, London, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0002-4161-985X","affiliations":[{"raw_affiliation_string":"Imperial College London, London, United Kingdom","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":null,"apc_paid":null,"fwci":1.7708,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.83905746,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"9","issue":"POPL","first_page":"1657","last_page":"1686"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9973999857902527,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9973999857902527,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.699480414390564},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4248260259628296},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40728944540023804},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35294151306152344},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3365525007247925}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.699480414390564},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4248260259628296},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40728944540023804},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35294151306152344},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3365525007247925}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3704892","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704892","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"}],"best_oa_location":{"id":"doi:10.1145/3704892","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704892","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":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1538065081","https://openalex.org/W1570949334","https://openalex.org/W1582964523","https://openalex.org/W1733693735","https://openalex.org/W1764096108","https://openalex.org/W1989483469","https://openalex.org/W1991984504","https://openalex.org/W1996151507","https://openalex.org/W1998546360","https://openalex.org/W2006820476","https://openalex.org/W2023185056","https://openalex.org/W2045900383","https://openalex.org/W2054262476","https://openalex.org/W2064138295","https://openalex.org/W2069545812","https://openalex.org/W2074556793","https://openalex.org/W2074592053","https://openalex.org/W2080726204","https://openalex.org/W2082232201","https://openalex.org/W2127956576","https://openalex.org/W2139247070","https://openalex.org/W2188068291","https://openalex.org/W2330615095","https://openalex.org/W2396664939","https://openalex.org/W2591389664","https://openalex.org/W2751199924","https://openalex.org/W2767001837","https://openalex.org/W3024851999","https://openalex.org/W3141612224","https://openalex.org/W3144150410","https://openalex.org/W3193490601","https://openalex.org/W4205786399","https://openalex.org/W4210249530","https://openalex.org/W4282043962","https://openalex.org/W4313529991","https://openalex.org/W4390605513","https://openalex.org/W6948126345"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"Graphs":[0],"and":[1,78,139,156],"their":[2,79],"algorithms":[3,44,80],"are":[4,83],"fundamental":[5],"to":[6,14,57,61,121,126,134,152],"computer":[7],"science,":[8],"but":[9],"they":[10],"can":[11],"be":[12,153],"difficult":[13],"formalise,":[15],"especially":[16],"in":[17,47,95],"dependently-typed":[18],"proof":[19],"assistants.":[20],"Part":[21],"of":[22,55,76,147],"the":[23,89,140,145],"problem":[24,40],"is":[25,41,105],"that":[26,42],"graphs":[27,63,77,82],"aren\u2019t":[28,51],"as":[29,31,85],"well-behaved":[30],"inductive":[32,68],"data":[33],"types":[34],"like":[35,65],"trees":[36],"or":[37],"lists;":[38],"another":[39],"graph":[43,142],"(at":[45],"least":[46],"standard":[48],"presentations)":[49],"often":[50],"structurally":[52],"recursive.":[53],"Instead":[54],"trying":[56],"find":[58],"a":[59,73],"way":[60],"make":[62,122],"behave":[64],"other":[66],"familiar":[67],"types,":[69,118],"this":[70],"paper":[71],"builds":[72],"formal":[74],"theory":[75,94],"where":[81],"treated":[84],"coinductive":[86],"structures":[87],"from":[88],"beginning.":[90],"We":[91],"formalise":[92],"our":[93,113,148],"Agda.":[96],"This":[97],"approach":[98],"has":[99],"its":[100],"own":[101],"unique":[102],"challenges:":[103],"Agda":[104],"more":[106],"comfortable":[107],"with":[108,136],"induction":[109],"than":[110],"coinduction.":[111],"Additionally,":[112],"formalisation":[114],"relies":[115],"on":[116],"quotient":[117],"which":[119],"tend":[120],"coinduction":[123],"even":[124],"harder":[125],"deal":[127,135],"with.":[128],"Nonetheless,":[129],"we":[130],"develop":[131],"reusable":[132],"techniques":[133],"these":[137],"difficulties,":[138],"simple":[141],"representation":[143],"at":[144],"heart":[146],"work":[149],"turns":[150],"out":[151],"flexible,":[154],"powerful,":[155],"formalisable.":[157]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}