{"id":"https://openalex.org/W1969167499","doi":"https://doi.org/10.1145/2500365.2500597","title":"Productive coprogramming with guarded recursion","display_name":"Productive coprogramming with guarded recursion","publication_year":2013,"publication_date":"2013-09-25","ids":{"openalex":"https://openalex.org/W1969167499","doi":"https://doi.org/10.1145/2500365.2500597","mag":"1969167499"},"language":"en","primary_location":{"id":"doi:10.1145/2500365.2500597","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2500365.2500597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th 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/A5036444096","display_name":"Robert Atkey","orcid":"https://orcid.org/0000-0002-4414-5047"},"institutions":[{"id":"https://openalex.org/I4210161980","display_name":"Quantemplate (United Kingdom)","ror":"https://ror.org/05qjcpt44","country_code":"GB","type":"company","lineage":["https://openalex.org/I4210161980"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Robert Atkey","raw_affiliation_strings":["Contemplate Ltd., Edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Contemplate Ltd., Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I4210161980"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090954120","display_name":"Conor McBride","orcid":"https://orcid.org/0000-0003-1487-0886"},"institutions":[{"id":"https://openalex.org/I181647926","display_name":"University of Strathclyde","ror":"https://ror.org/00n3w3b69","country_code":"GB","type":"education","lineage":["https://openalex.org/I181647926"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Conor McBride","raw_affiliation_strings":["University of Strathclyde, Glasgow, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Strathclyde, Glasgow, United Kingdom","institution_ids":["https://openalex.org/I181647926"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036444096"],"corresponding_institution_ids":["https://openalex.org/I4210161980"],"apc_list":null,"apc_paid":null,"fwci":13.3443,"has_fulltext":false,"cited_by_count":77,"citation_normalized_percentile":{"value":0.98634756,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"197","last_page":"208"},"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.9997000098228455,"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.9997000098228455,"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.9972000122070312,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.992900013923645,"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.8387081623077393},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.7675784826278687},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7023406624794006},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6738312840461731},{"id":"https://openalex.org/keywords/productivity","display_name":"Productivity","score":0.5445634722709656},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.5130301713943481},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.4946727454662323},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.48899519443511963},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41505375504493713},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.13400423526763916}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8387081623077393},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7675784826278687},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7023406624794006},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6738312840461731},{"id":"https://openalex.org/C204983608","wikidata":"https://www.wikidata.org/wiki/Q2111958","display_name":"Productivity","level":2,"score":0.5445634722709656},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.5130301713943481},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.4946727454662323},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.48899519443511963},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41505375504493713},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.13400423526763916},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C139719470","wikidata":"https://www.wikidata.org/wiki/Q39680","display_name":"Macroeconomics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2500365.2500597","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2500365.2500597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM SIGPLAN international conference on Functional programming","raw_type":"proceedings-article"},{"id":"pmh:oai:strathprints.strath.ac.uk:44848","is_oa":false,"landing_page_url":"https://strathprints.strath.ac.uk/44848/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402226","display_name":"Strathprints: The University of Strathclyde institutional repository (University of Strathclyde)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I181647926","host_organization_name":"University of Strathclyde","host_organization_lineage":["https://openalex.org/I181647926"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5600000023841858,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W90014207","https://openalex.org/W1551132038","https://openalex.org/W1978353388","https://openalex.org/W1980786790","https://openalex.org/W1984902166","https://openalex.org/W1991984504","https://openalex.org/W2020263799","https://openalex.org/W2020900140","https://openalex.org/W2024873396","https://openalex.org/W2046213250","https://openalex.org/W2060662244","https://openalex.org/W2070811535","https://openalex.org/W2074802267","https://openalex.org/W2097508095","https://openalex.org/W2104860831","https://openalex.org/W2116813111","https://openalex.org/W2123329569","https://openalex.org/W2128992690","https://openalex.org/W2132181573","https://openalex.org/W2156432575","https://openalex.org/W2158789193","https://openalex.org/W2183460091","https://openalex.org/W2753543077","https://openalex.org/W3099809655","https://openalex.org/W3101768401","https://openalex.org/W3139910095","https://openalex.org/W4231894538","https://openalex.org/W6603728238","https://openalex.org/W6675938074","https://openalex.org/W6678289079","https://openalex.org/W6678906891","https://openalex.org/W6686280003"],"related_works":["https://openalex.org/W4240253816","https://openalex.org/W3096456556","https://openalex.org/W2092530219","https://openalex.org/W1976679120","https://openalex.org/W2169584677","https://openalex.org/W2979513934","https://openalex.org/W4232954277","https://openalex.org/W4281614748","https://openalex.org/W2377519369","https://openalex.org/W3012836300"],"abstract_inverted_index":{"Total":[0],"functional":[1],"programming":[2,73,99],"offers":[3],"the":[4,12,26,80],"beguiling":[5],"vision":[6],"that,":[7,49],"just":[8],"by":[9,79],"virtue":[10],"of":[11,28,58,84,90],"compiler":[13],"accepting":[14],"a":[15,52,96],"program,":[16],"we":[17,38,88],"are":[18,31,39],"guaranteed":[19,40],"that":[20,30,41],"it":[21],"will":[22,43,62],"always":[23,44],"terminate.":[24],"In":[25],"case":[27],"programs":[29,42],"not":[32],"intended":[33],"to":[34,98],"terminate,":[35],"e.g.,":[36],"servers,":[37],"be":[45,63],"productive.":[46],"Productivity":[47],"means":[48],"even":[50],"if":[51],"program":[53],"generates":[54],"an":[55],"infinite":[56,75],"amount":[57],"data,":[59],"each":[60],"piece":[61],"generated":[64],"in":[65],"finite":[66,104],"time.":[67],"The":[68],"theoretical":[69],"underpinning":[70],"for":[71],"productive":[72],"with":[74,92,100],"output":[76],"is":[77],"provided":[78],"category":[81],"theoretic":[82],"notion":[83],"final":[85],"coalgebras.":[86],"Hence,":[87],"speak":[89],"coprogramming":[91],"non-well-founded":[93],"codata,":[94],"as":[95],"dual":[97],"well-founded":[101],"data":[102],"like":[103],"lists":[105],"and":[106],"trees.":[107]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}