{"id":"https://openalex.org/W3139939291","doi":"https://doi.org/10.1109/formsera.2012.6229782","title":"Making sense of recursion patterns","display_name":"Making sense of recursion patterns","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W3139939291","doi":"https://doi.org/10.1109/formsera.2012.6229782","mag":"3139939291"},"language":"en","primary_location":{"id":"doi:10.1109/formsera.2012.6229782","is_oa":false,"landing_page_url":"https://doi.org/10.1109/formsera.2012.6229782","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches (FormSERA)","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/A5039631193","display_name":"Paul A. Bailes","orcid":null},"institutions":[{"id":"https://openalex.org/I160993911","display_name":"Queensland University of Technology","ror":"https://ror.org/03pnv4752","country_code":"AU","type":"education","lineage":["https://openalex.org/I160993911"]},{"id":"https://openalex.org/I165143802","display_name":"The University of Queensland","ror":"https://ror.org/00rqy9422","country_code":"AU","type":"education","lineage":["https://openalex.org/I165143802"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Paul Bailes","raw_affiliation_strings":["School of Information Technology and Electrical Engineering, University of Queensland, QLD, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Technology and Electrical Engineering, University of Queensland, QLD, Australia","institution_ids":["https://openalex.org/I160993911","https://openalex.org/I165143802"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004442506","display_name":"Leighton Brough","orcid":null},"institutions":[{"id":"https://openalex.org/I160993911","display_name":"Queensland University of Technology","ror":"https://ror.org/03pnv4752","country_code":"AU","type":"education","lineage":["https://openalex.org/I160993911"]},{"id":"https://openalex.org/I165143802","display_name":"The University of Queensland","ror":"https://ror.org/00rqy9422","country_code":"AU","type":"education","lineage":["https://openalex.org/I165143802"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Leighton Brough","raw_affiliation_strings":["School of Information Technology and Electrical Engineering, University of Queensland, QLD, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Technology and Electrical Engineering, University of Queensland, QLD, Australia","institution_ids":["https://openalex.org/I160993911","https://openalex.org/I165143802"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3269,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.85609785,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"185","issue":null,"first_page":"16","last_page":"22"},"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.9987000226974487,"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.9987000226974487,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.987500011920929,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9591801166534424},{"id":"https://openalex.org/keywords/mutual-recursion","display_name":"Mutual recursion","score":0.7690340280532837},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7120331525802612},{"id":"https://openalex.org/keywords/double-recursion","display_name":"Double recursion","score":0.6224682927131653},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.5619816780090332},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5312017798423767},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4298442006111145},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38556668162345886},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.30846357345581055}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.9591801166534424},{"id":"https://openalex.org/C124416688","wikidata":"https://www.wikidata.org/wiki/Q3454656","display_name":"Mutual recursion","level":3,"score":0.7690340280532837},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7120331525802612},{"id":"https://openalex.org/C139503435","wikidata":"https://www.wikidata.org/wiki/Q5300083","display_name":"Double recursion","level":3,"score":0.6224682927131653},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.5619816780090332},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5312017798423767},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4298442006111145},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38556668162345886},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.30846357345581055}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/formsera.2012.6229782","is_oa":false,"landing_page_url":"https://doi.org/10.1109/formsera.2012.6229782","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches (FormSERA)","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":24,"referenced_works":["https://openalex.org/W23342596","https://openalex.org/W1483568252","https://openalex.org/W1541318173","https://openalex.org/W1568456273","https://openalex.org/W1608714802","https://openalex.org/W1874450173","https://openalex.org/W1994718921","https://openalex.org/W2070811535","https://openalex.org/W2101565274","https://openalex.org/W2103953153","https://openalex.org/W2110979194","https://openalex.org/W2125743465","https://openalex.org/W2154273644","https://openalex.org/W2172307690","https://openalex.org/W2175912519","https://openalex.org/W2318815169","https://openalex.org/W2566429402","https://openalex.org/W4252345548","https://openalex.org/W6634024339","https://openalex.org/W6636266456","https://openalex.org/W6639140226","https://openalex.org/W6678728117","https://openalex.org/W6685587801","https://openalex.org/W6731824683"],"related_works":["https://openalex.org/W2006836388","https://openalex.org/W2896379815","https://openalex.org/W4249703975","https://openalex.org/W2374742784","https://openalex.org/W223586891","https://openalex.org/W2155605358","https://openalex.org/W1563586960","https://openalex.org/W560887346","https://openalex.org/W4246540581","https://openalex.org/W2044963554"],"abstract_inverted_index":{"Recursion":[0],"patterns":[1],"(such":[2],"as":[3],"\u201cfoldr\u201d":[4],"and":[5,47,71,74,96],"elaborations":[6],"thereof)":[7],"have":[8],"the":[9,37,67,81],"potential":[10],"to":[11,27,30,45,66,89],"supplant":[12],"explicit":[13,32],"recursion":[14,33,41,54,72],"in":[15,25,36,85,94],"a":[16,49],"viable":[17],"subrecursive":[18],"functional":[19],"style":[20],"of":[21,39,52,59,69,80],"programming.":[22],"Especially":[23],"however":[24],"order":[26],"be":[28],"able":[29],"eschew":[31],"entirely,":[34],"even":[35],"definition":[38],"new":[40],"patterns,":[42,73],"it's":[43],"essential":[44],"identify":[46],"validate":[48],"minimal":[50],"set":[51],"basic":[53],"patterns.":[55],"The":[56],"immediate":[57],"plausibility":[58],"foldr":[60],"is":[61],"validated":[62],"by":[63,76],"its":[64],"application":[65],"implementation":[68],"functions":[70],"especially":[75],"an":[77],"abstract":[78],"characterization":[79],"programming":[82],"devices":[83],"used":[84,88],"these":[86],"applications":[87],"overcome":[90],"complementary":[91],"information":[92],"deficiencies":[93],"data":[95],"control.":[97]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}