{"id":"https://openalex.org/W4315605975","doi":"https://doi.org/10.1145/3571196","title":"A Type-Based Approach to Divide-and-Conquer Recursion in Coq","display_name":"A Type-Based Approach to Divide-and-Conquer Recursion in Coq","publication_year":2023,"publication_date":"2023-01-09","ids":{"openalex":"https://openalex.org/W4315605975","doi":"https://doi.org/10.1145/3571196"},"language":"en","primary_location":{"id":"doi:10.1145/3571196","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3571196","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3571196","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":null,"license_id":null,"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://dl.acm.org/doi/pdf/10.1145/3571196","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001278479","display_name":"Pedro Abreu","orcid":"https://orcid.org/0000-0001-7790-6116"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Pedro Abreu","raw_affiliation_strings":["Purdue University, USA"],"affiliations":[{"raw_affiliation_string":"Purdue University, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073767542","display_name":"Benjamin Delaware","orcid":"https://orcid.org/0000-0002-1016-6261"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benjamin Delaware","raw_affiliation_strings":["Purdue University, USA"],"affiliations":[{"raw_affiliation_string":"Purdue University, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084871422","display_name":"Alex Hubers","orcid":"https://orcid.org/0000-0002-6237-3326"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alex Hubers","raw_affiliation_strings":["University of Iowa, USA"],"affiliations":[{"raw_affiliation_string":"University of Iowa, USA","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020535463","display_name":"Christa Jenkins","orcid":"https://orcid.org/0000-0002-5434-5018"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christa Jenkins","raw_affiliation_strings":["University of Iowa, USA"],"affiliations":[{"raw_affiliation_string":"University of Iowa, USA","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067671067","display_name":"J. Garrett Morris","orcid":"https://orcid.org/0000-0002-3992-1080"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Garrett Morris","raw_affiliation_strings":["University of Iowa, USA"],"affiliations":[{"raw_affiliation_string":"University of Iowa, USA","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072489480","display_name":"Aaron Stump","orcid":"https://orcid.org/0000-0002-9720-0003"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aaron Stump","raw_affiliation_strings":["University of Iowa, USA"],"affiliations":[{"raw_affiliation_string":"University of Iowa, USA","institution_ids":["https://openalex.org/I126307644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5001278479"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0043884,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":"POPL","first_page":"61","last_page":"90"},"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.9998999834060669,"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.9998999834060669,"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.9854000210762024,"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/T11424","display_name":"Security and Verification in Computing","score":0.9818999767303467,"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/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.9278532862663269},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.7463260889053345},{"id":"https://openalex.org/keywords/quicksort","display_name":"Quicksort","score":0.6920675039291382},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6465888023376465},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.4906269609928131},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.47757771611213684},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.45218533277511597},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4516722559928894},{"id":"https://openalex.org/keywords/type-theory","display_name":"Type theory","score":0.4405898451805115},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4065846800804138},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3858274519443512},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32338282465934753},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.18495896458625793},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.13768887519836426},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.11395484209060669}],"concepts":[{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.9278532862663269},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7463260889053345},{"id":"https://openalex.org/C2778937211","wikidata":"https://www.wikidata.org/wiki/Q486598","display_name":"Quicksort","level":4,"score":0.6920675039291382},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6465888023376465},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.4906269609928131},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.47757771611213684},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.45218533277511597},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4516722559928894},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.4405898451805115},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4065846800804138},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3858274519443512},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32338282465934753},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.18495896458625793},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.13768887519836426},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.11395484209060669},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3571196","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3571196","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3571196","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":null,"license_id":null,"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/3571196","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3571196","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3571196","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":null,"license_id":null,"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.6600000262260437,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320309036","display_name":"Purdue University","ror":"https://ror.org/02dqehb95"},{"id":"https://openalex.org/F4320309668","display_name":"Graduate School, Purdue University","ror":"https://ror.org/02dqehb95"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4315605975.pdf","grobid_xml":"https://content.openalex.org/works/W4315605975.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W1464569014","https://openalex.org/W1496429054","https://openalex.org/W1504424419","https://openalex.org/W1536469717","https://openalex.org/W1551036056","https://openalex.org/W1580101844","https://openalex.org/W1581378641","https://openalex.org/W1868063025","https://openalex.org/W1986402635","https://openalex.org/W2000295225","https://openalex.org/W2003295197","https://openalex.org/W2003701327","https://openalex.org/W2023353691","https://openalex.org/W2082393912","https://openalex.org/W2092268590","https://openalex.org/W2095835314","https://openalex.org/W2097281451","https://openalex.org/W2104422179","https://openalex.org/W2110979194","https://openalex.org/W2122353578","https://openalex.org/W2124318699","https://openalex.org/W2130427425","https://openalex.org/W2131315680","https://openalex.org/W2146471655","https://openalex.org/W2148387264","https://openalex.org/W2163552400","https://openalex.org/W2168162624","https://openalex.org/W2171496589","https://openalex.org/W2746677766","https://openalex.org/W2888153140","https://openalex.org/W2950542597","https://openalex.org/W2953833525","https://openalex.org/W2965156518","https://openalex.org/W3014685094","https://openalex.org/W3047511223","https://openalex.org/W3103755743","https://openalex.org/W3135839603","https://openalex.org/W4298072213","https://openalex.org/W4320932532","https://openalex.org/W6630237704","https://openalex.org/W6637614347"],"related_works":["https://openalex.org/W2365903163","https://openalex.org/W1532335840","https://openalex.org/W2079638187","https://openalex.org/W4385572520","https://openalex.org/W2142224267","https://openalex.org/W4315605975","https://openalex.org/W2184361615","https://openalex.org/W2133055704","https://openalex.org/W1999651574","https://openalex.org/W1575643632"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,39,96,141],"new":[4],"approach":[5,31,79],"to":[6,24,32,150],"writing":[7],"and":[8,43,87,132],"verifying":[9],"divide-and-conquer":[10,33,144],"programs":[11],"in":[12,91,107],"Coq.":[13],"Extending":[14],"the":[15,58,69,83,105],"rich":[16],"line":[17],"of":[18,41,72,99,104,143],"previous":[19],"work":[20],"on":[21,112,116,123],"algebraic":[22,30],"approaches":[23],"recursion":[25,74,114],"schemes,":[26],"we":[27],"present":[28],"an":[29],"recursion:":[34],"recursions":[35,51,60],"are":[36],"represented":[37],"as":[38],"form":[40,98,142],"algebra,":[42],"from":[44,82],"outer":[45,59],"recursions,":[46],"one":[47],"may":[48,61],"initiate":[49],"inner":[50],"that":[52,146],"can":[53,88,147],"construct":[54],"data":[55],"upon":[56],"which":[57],"legally":[62],"recurse.":[63],"Termination":[64],"is":[65,121,137],"enforced":[66],"entirely":[67],"by":[68],"typing":[70],"discipline":[71],"our":[73,78,156],"schemes.":[75],"Despite":[76],"this,":[77],"requires":[80],"little":[81],"underlying":[84],"type":[85],"system,":[86],"be":[89,148],"implemented":[90],"System":[92],"F":[93],"\u03c9":[94],"plus":[95],"limited":[97],"positive-recursive":[100],"types.":[101,118],"Our":[102],"implementation":[103],"method":[106,120],"Coq":[108],"does":[109],"not":[110],"rely":[111],"structural":[113],"or":[115],"dependent":[117],"The":[119],"demonstrated":[122],"several":[124],"examples,":[125],"including":[126],"mergesort,":[127],"quicksort,":[128],"Harper\u2019s":[129],"regular-expression":[130],"matcher,":[131],"others.":[133],"An":[134],"indexed":[135],"version":[136],"also":[138],"derived,":[139],"implementing":[140],"induction":[145],"used":[149],"reason":[151],"about":[152],"functions":[153],"defined":[154],"via":[155],"method.":[157]},"counts_by_year":[],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}