{"id":"https://openalex.org/W2014143852","doi":"https://doi.org/10.1145/2676726.2676989","title":"Conjugate Hylomorphisms -- Or","display_name":"Conjugate Hylomorphisms -- Or","publication_year":2014,"publication_date":"2014-12-19","ids":{"openalex":"https://openalex.org/W2014143852","doi":"https://doi.org/10.1145/2676726.2676989","mag":"2014143852"},"language":"en","primary_location":{"id":"doi:10.1145/2676726.2676989","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2676726.2676989","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063247380","display_name":"Ralf Hinze","orcid":"https://orcid.org/0000-0001-5678-0286"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ralf Hinze","raw_affiliation_strings":["University of Oxford, Oxford, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072641397","display_name":"Nicolas Wu","orcid":"https://orcid.org/0000-0002-4161-985X"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nicolas Wu","raw_affiliation_strings":["University of Oxford, Oxford, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086558126","display_name":"Jeremy Gibbons","orcid":"https://orcid.org/0000-0002-8426-9917"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jeremy Gibbons","raw_affiliation_strings":["University of Oxford, Oxford, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":1.0339,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.77609165,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"527","last_page":"538"},"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.9998000264167786,"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.9998000264167786,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9955999851226807,"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.9743000268936157,"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.8741077780723572},{"id":"https://openalex.org/keywords/haskell","display_name":"Haskell","score":0.8365070819854736},{"id":"https://openalex.org/keywords/adjunction","display_name":"Adjunction","score":0.7564405202865601},{"id":"https://openalex.org/keywords/coalgebra","display_name":"Coalgebra","score":0.7292483448982239},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.5933699607849121},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5827361345291138},{"id":"https://openalex.org/keywords/functor","display_name":"Functor","score":0.5788251161575317},{"id":"https://openalex.org/keywords/toolbox","display_name":"Toolbox","score":0.5590970516204834},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.5306210517883301},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4664306938648224},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4638165831565857},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46349358558654785},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4490370452404022},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.32863885164260864},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3286304473876953},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22898197174072266},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.20471304655075073},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2024957239627838},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1878068447113037}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8741077780723572},{"id":"https://openalex.org/C2780624054","wikidata":"https://www.wikidata.org/wiki/Q34010","display_name":"Haskell","level":3,"score":0.8365070819854736},{"id":"https://openalex.org/C2780580338","wikidata":"https://www.wikidata.org/wiki/Q577835","display_name":"Adjunction","level":2,"score":0.7564405202865601},{"id":"https://openalex.org/C2778249326","wikidata":"https://www.wikidata.org/wiki/Q1777803","display_name":"Coalgebra","level":3,"score":0.7292483448982239},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.5933699607849121},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5827361345291138},{"id":"https://openalex.org/C156772000","wikidata":"https://www.wikidata.org/wiki/Q864475","display_name":"Functor","level":2,"score":0.5788251161575317},{"id":"https://openalex.org/C2777655017","wikidata":"https://www.wikidata.org/wiki/Q1501161","display_name":"Toolbox","level":2,"score":0.5590970516204834},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.5306210517883301},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4664306938648224},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4638165831565857},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46349358558654785},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4490370452404022},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.32863885164260864},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3286304473876953},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22898197174072266},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.20471304655075073},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2024957239627838},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1878068447113037},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2676726.2676989","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2676726.2676989","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/53d0ed69-112f-4394-897d-2c7f7be0520d","is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/53d0ed69-112f-4394-897d-2c7f7be0520d","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hinze, R, Wu, N & Gibbons, J 2015, Conjugate Hylomorphisms : The Mother of All Structured Recursion Schemes. in Proceedings of the 42Nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL '15, Association for Computing Machinery, New York, NY, USA, pp. 527-538. https://doi.org/10.1145/2676726.2676989","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5861354049","display_name":null,"funder_award_id":"EP/J010995/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7992805444","display_name":"Unifying Theories of Generic Programming","funder_award_id":"EP/J010995/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W50416634","https://openalex.org/W79336753","https://openalex.org/W1485825789","https://openalex.org/W1552676905","https://openalex.org/W1571615440","https://openalex.org/W1587758675","https://openalex.org/W1608714802","https://openalex.org/W1859242033","https://openalex.org/W1975580206","https://openalex.org/W1982594584","https://openalex.org/W2034224051","https://openalex.org/W2036563325","https://openalex.org/W2079698957","https://openalex.org/W2082232201","https://openalex.org/W2085858043","https://openalex.org/W2105287078","https://openalex.org/W2110979194","https://openalex.org/W2116908067","https://openalex.org/W2120713972","https://openalex.org/W2133393261","https://openalex.org/W2135326783","https://openalex.org/W2143566245","https://openalex.org/W2151015971","https://openalex.org/W2160809209","https://openalex.org/W2163256338","https://openalex.org/W2242079500","https://openalex.org/W2913307897","https://openalex.org/W4244792373","https://openalex.org/W4253666772","https://openalex.org/W6603250414","https://openalex.org/W6629115058","https://openalex.org/W6638899084","https://openalex.org/W6690934218","https://openalex.org/W6758914716","https://openalex.org/W7011714115"],"related_works":["https://openalex.org/W2112263414","https://openalex.org/W3004782279","https://openalex.org/W1602185604","https://openalex.org/W2028779182","https://openalex.org/W1982594584","https://openalex.org/W4242678340","https://openalex.org/W2140654465","https://openalex.org/W2129253059","https://openalex.org/W1488646450","https://openalex.org/W4296274916"],"abstract_inverted_index":{"The":[0,146],"past":[1],"decades":[2],"have":[3,68],"witnessed":[4],"an":[5,42,86,116],"extensive":[6],"study":[7],"of":[8,22,92,118,132,154],"structured":[9,109],"recursion":[10,103,110],"schemes.":[11,104],"A":[12],"general":[13],"scheme":[14,111],"is":[15,26,77,140,149],"the":[16,20,37,72,78,119,128,137,144],"hylomorphism,":[17],"which":[18,60],"captures":[19],"essence":[21],"divide-and-conquer:":[23],"a":[24,31,46,53,81,89,152],"problem":[25],"broken":[27],"into":[28],"sub-problems":[29,33],"by":[30,41,61,85,151],"coalgebra;":[32],"are":[34,39],"solved":[35],"recursively;":[36],"sub-solutions":[38],"combined":[40],"algebra":[43],"to":[44,113,127,143],"form":[45],"solution.":[47],"In":[48,105],"this":[49],"paper":[50],"we":[51,123],"develop":[52],"simple":[54],"toolbox":[55,126],"for":[56],"assembling":[57],"recursive":[58,134],"coalgebras,":[59,135],"definition":[62],"ensure":[63],"that":[64,97],"their":[65],"hylo":[66],"equations":[67],"unique":[69],"solutions,":[70],"whatever":[71],"algebra.":[73,145],"Our":[74],"main":[75],"tool":[76],"conjugate":[79,90,120],"rule,":[80],"generic":[82],"rule":[83],"parametrized":[84],"adjunction":[87],"and":[88],"pair":[91],"natural":[93],"transformations.":[94],"We":[95],"show":[96],"many":[98],"basic":[99],"adjunctions":[100],"induce":[101],"useful":[102],"fact,":[106],"almost":[107],"every":[108],"seems":[112],"arise":[114],"as":[115],"instance":[117],"rule.":[121],"Further,":[122],"adapt":[124],"our":[125],"more":[129],"expressive":[130],"setting":[131],"parametrically":[133],"where":[136],"original":[138],"input":[139],"also":[141],"passed":[142],"formal":[147],"development":[148],"complemented":[150],"series":[153],"worked-out":[155],"examples":[156],"in":[157],"Haskell.":[158]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}