{"id":"https://openalex.org/W2162912003","doi":"https://doi.org/10.1145/2541568.2541575","title":"The recursive polarized dual calculus","display_name":"The recursive polarized dual calculus","publication_year":2014,"publication_date":"2014-01-11","ids":{"openalex":"https://openalex.org/W2162912003","doi":"https://doi.org/10.1145/2541568.2541575","mag":"2162912003"},"language":"en","primary_location":{"id":"doi:10.1145/2541568.2541575","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2541568.2541575","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGPLAN 2014 Workshop on Programming Languages meets Program Verification","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/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":true,"raw_author_name":"Aaron Stump","raw_affiliation_strings":["The University of Iowa, Iowa City, IA, USA"],"affiliations":[{"raw_affiliation_string":"The University of Iowa, Iowa City, IA, USA","institution_ids":["https://openalex.org/I126307644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072489480"],"corresponding_institution_ids":["https://openalex.org/I126307644"],"apc_list":null,"apc_paid":null,"fwci":0.409,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.75598738,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"3","last_page":"14"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9973000288009644,"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.9901999831199646,"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.8135498762130737},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.6233150362968445},{"id":"https://openalex.org/keywords/coinduction","display_name":"Coinduction","score":0.6087126135826111},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5048685669898987},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49187517166137695},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.469461590051651},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.44912010431289673},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.44806328415870667},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.44364702701568604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43967756628990173},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3446715474128723},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3387821912765503},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31484556198120117},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.18967995047569275},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.11413964629173279}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8135498762130737},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.6233150362968445},{"id":"https://openalex.org/C40220748","wikidata":"https://www.wikidata.org/wiki/Q4227156","display_name":"Coinduction","level":3,"score":0.6087126135826111},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5048685669898987},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49187517166137695},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.469461590051651},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.44912010431289673},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.44806328415870667},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.44364702701568604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43967756628990173},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3446715474128723},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3387821912765503},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31484556198120117},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.18967995047569275},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.11413964629173279},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2541568.2541575","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2541568.2541575","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGPLAN 2014 Workshop on Programming Languages meets Program Verification","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1552101395","https://openalex.org/W1580664042","https://openalex.org/W1969167499","https://openalex.org/W2007759294","https://openalex.org/W2008920425","https://openalex.org/W2010819384","https://openalex.org/W2015640848","https://openalex.org/W2016326123","https://openalex.org/W2053198071","https://openalex.org/W2059992573","https://openalex.org/W2085552917","https://openalex.org/W2096529083","https://openalex.org/W2131807903","https://openalex.org/W2134649613","https://openalex.org/W2135287414","https://openalex.org/W2143730076","https://openalex.org/W2159159702","https://openalex.org/W2293168108","https://openalex.org/W4300401287","https://openalex.org/W6633088523","https://openalex.org/W6665889499"],"related_works":["https://openalex.org/W3089011244","https://openalex.org/W2592977449","https://openalex.org/W1803721540","https://openalex.org/W4244779119","https://openalex.org/W2573921324","https://openalex.org/W4296959565","https://openalex.org/W2163981019","https://openalex.org/W4221148740","https://openalex.org/W4362597565","https://openalex.org/W1792924550"],"abstract_inverted_index":{"This":[0,84],"paper":[1],"introduces":[2],"the":[3],"Recursive":[4],"Polarized":[5],"Dual":[6,12],"Calculus":[7],"(RP-DC),":[8],"based":[9],"on":[10],"Wadler's":[11],"Calculus.":[13],"RP-DC":[14,87],"features":[15],"a":[16,68,77],"polarized":[17],"form":[18],"of":[19,58,76,80],"reduction,":[20],"which":[21,37],"enables":[22],"several":[23,56],"simplifications":[24],"over":[25],"previous":[26],"related":[27],"systems.":[28],"It":[29],"also":[30],"adds":[31],"inductive":[32],"types":[33,39,81],"with":[34,40],"recursion,":[35],"from":[36],"coinductive":[38],"corecursion":[41],"can":[42,88],"be":[43,89],"defined.":[44],"Typing":[45],"and":[46,53],"reduction":[47],"relations":[48],"are":[49,82,98],"defined":[50],"for":[51,91],"RP-DC,":[52],"we":[54],"consider":[55],"examples":[57],"practical":[59,92],"programming.":[60],"Logical":[61],"consistency":[62],"is":[63],"proved,":[64],"as":[65,67],"well":[66],"canonicity":[69],"theorem":[70],"showing":[71],"that":[72],"all":[73],"closed":[74],"values":[75],"certain":[78],"family":[79],"canonical.":[83],"shows":[85],"how":[86],"used":[90],"programming,":[93],"where":[94],"canonical":[95],"final":[96],"results":[97],"required.":[99]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}