{"id":"https://openalex.org/W1971461250","doi":"https://doi.org/10.1145/2784731.2784762","title":"Structures for structural recursion","display_name":"Structures for structural recursion","publication_year":2015,"publication_date":"2015-08-26","ids":{"openalex":"https://openalex.org/W1971461250","doi":"https://doi.org/10.1145/2784731.2784762","mag":"1971461250"},"language":"en","primary_location":{"id":"doi:10.1145/2784731.2784762","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2784731.2784762","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming","raw_type":"proceedings-article"},"type":"article","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/A5020454182","display_name":"Paul Downen","orcid":"https://orcid.org/0000-0003-0165-9387"},"institutions":[{"id":"https://openalex.org/I181233156","display_name":"University of Oregon","ror":"https://ror.org/0293rh119","country_code":"US","type":"education","lineage":["https://openalex.org/I181233156"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Paul Downen","raw_affiliation_strings":["University of Oregon, USA"],"affiliations":[{"raw_affiliation_string":"University of Oregon, USA","institution_ids":["https://openalex.org/I181233156"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049510187","display_name":"Philip Johnson-Freyd","orcid":"https://orcid.org/0000-0001-5973-0671"},"institutions":[{"id":"https://openalex.org/I181233156","display_name":"University of Oregon","ror":"https://ror.org/0293rh119","country_code":"US","type":"education","lineage":["https://openalex.org/I181233156"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Philip Johnson-Freyd","raw_affiliation_strings":["University of Oregon, USA"],"affiliations":[{"raw_affiliation_string":"University of Oregon, USA","institution_ids":["https://openalex.org/I181233156"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064696313","display_name":"Zena M. Ariola","orcid":"https://orcid.org/0000-0001-5551-8294"},"institutions":[{"id":"https://openalex.org/I181233156","display_name":"University of Oregon","ror":"https://ror.org/0293rh119","country_code":"US","type":"education","lineage":["https://openalex.org/I181233156"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zena M. Ariola","raw_affiliation_strings":["University of Oregon, USA"],"affiliations":[{"raw_affiliation_string":"University of Oregon, USA","institution_ids":["https://openalex.org/I181233156"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020454182"],"corresponding_institution_ids":["https://openalex.org/I181233156"],"apc_list":null,"apc_paid":null,"fwci":1.2943,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.85436852,"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":"127","last_page":"139"},"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.9984999895095825,"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.9977999925613403,"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.8905434608459473},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.6865496039390564},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5772319436073303},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.538784384727478},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.4605371952056885},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.4388974606990814},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.42938101291656494},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3903178870677948},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.35647597908973694},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3101242184638977},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28129011392593384},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.22135120630264282},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.19564315676689148}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8905434608459473},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.6865496039390564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5772319436073303},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.538784384727478},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.4605371952056885},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.4388974606990814},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.42938101291656494},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3903178870677948},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.35647597908973694},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3101242184638977},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28129011392593384},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.22135120630264282},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.19564315676689148},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","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":1,"locations":[{"id":"doi:10.1145/2784731.2784762","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2784731.2784762","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1813656873","display_name":null,"funder_award_id":"CCF-1423617","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W9785351","https://openalex.org/W40564209","https://openalex.org/W159715351","https://openalex.org/W1508224656","https://openalex.org/W1552101395","https://openalex.org/W1601239300","https://openalex.org/W1738264400","https://openalex.org/W1992668216","https://openalex.org/W2016326123","https://openalex.org/W2053198071","https://openalex.org/W2074592053","https://openalex.org/W2074767526","https://openalex.org/W2085552917","https://openalex.org/W2102706914","https://openalex.org/W2135287414","https://openalex.org/W2159159702","https://openalex.org/W2160728467","https://openalex.org/W2162592943","https://openalex.org/W2177357765","https://openalex.org/W4240184370","https://openalex.org/W4285719527","https://openalex.org/W6633088523"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W2480116122","https://openalex.org/W1976468483","https://openalex.org/W3122644328","https://openalex.org/W2164080590","https://openalex.org/W1019837216"],"abstract_inverted_index":{"Our":[0],"goal":[1],"is":[2,73,103,143],"to":[3,51],"develop":[4],"co-induction":[5],"from":[6],"our":[7],"understanding":[8],"of":[9,31,63,89,130,140,150,168,171],"induction,":[10],"putting":[11],"them":[12],"on":[13],"level":[14],"ground":[15],"as":[16,122],"equal":[17,90],"partners":[18],"for":[19,56,79,97,146,159],"reasoning":[20,39,124],"about":[21],"programs.":[22,34,101],"We":[23,152],"investigate":[24],"several":[25],"structures":[26,37],"which":[27,113,142],"represent":[28],"well-founded":[29],"forms":[30],"recursion":[32,54,80,99],"in":[33,100,110],"These":[35],"simple":[36],"encapsulate":[38],"by":[40,75,137],"primitive":[41],"and":[42,46,65,91,94],"noetherian":[43],"induction":[44],"principles,":[45],"can":[47],"be":[48],"composed":[49],"together":[50],"form":[52],"complex":[53],"schemes":[55],"programs":[57],"operating":[58],"over":[59],"a":[60,82,107,134,138,147,155],"wide":[61,148],"class":[62],"data":[64,93],"co-data":[66,95],"types.":[67],"At":[68],"its":[69],"heart,":[70],"this":[71],"study":[72],"guided":[74],"duality:":[76],"each":[77],"structure":[78],"has":[81],"dual":[83],"form,":[84],"giving":[85],"perfectly":[86],"symmetric":[87],"pairs":[88],"opposite":[92],"types":[96],"representing":[98,160],"Duality":[102],"brought":[104],"out":[105],"through":[106],"framework":[108],"presented":[109],"sequent":[111],"style,":[112],"inherently":[114],"includes":[115],"control":[116],"effects":[117],"that":[118],"are":[119],"interpreted":[120],"logically":[121],"classical":[123],"principles.":[125],"To":[126],"accommodate":[127],"the":[128,166,172],"presence":[129],"effects,":[131],"we":[132],"give":[133],"calculus":[135,158],"parameterized":[136],"notion":[139],"strategy,":[141],"strongly":[144],"normalizing":[145],"range":[149],"strategies.":[151],"also":[153],"present":[154],"more":[156],"traditional":[157],"effect-free":[161],"functional":[162],"programs,":[163],"but":[164],"at":[165],"cost":[167],"losing":[169],"some":[170],"founding":[173],"dualities.":[174]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}