{"id":"https://openalex.org/W2921845636","doi":"https://doi.org/10.1007/s10710-019-09347-3","title":"Stochastic synthesis of recursive functions made easy with bananas, lenses, envelopes and barbed wire","display_name":"Stochastic synthesis of recursive functions made easy with bananas, lenses, envelopes and barbed wire","publication_year":2019,"publication_date":"2019-03-14","ids":{"openalex":"https://openalex.org/W2921845636","doi":"https://doi.org/10.1007/s10710-019-09347-3","mag":"2921845636"},"language":"en","primary_location":{"id":"doi:10.1007/s10710-019-09347-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10710-019-09347-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10710-019-09347-3.pdf","source":{"id":"https://openalex.org/S47930974","display_name":"Genetic Programming and Evolvable Machines","issn_l":"1389-2576","issn":["1389-2576","1573-7632"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Genetic Programming and Evolvable Machines","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10710-019-09347-3.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037668386","display_name":"Jerry Swan","orcid":"https://orcid.org/0000-0003-1944-7147"},"institutions":[{"id":"https://openalex.org/I52099693","display_name":"University of York","ror":"https://ror.org/04m01e293","country_code":"GB","type":"education","lineage":["https://openalex.org/I52099693"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Jerry Swan","raw_affiliation_strings":["Department of Computer Science, University of York, YO10 5GH, York, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of York, YO10 5GH, York, UK","institution_ids":["https://openalex.org/I52099693"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034406933","display_name":"Krzysztof Krawiec","orcid":"https://orcid.org/0000-0001-5439-3231"},"institutions":[{"id":"https://openalex.org/I46597724","display_name":"Pozna\u0144 University of Technology","ror":"https://ror.org/00p7p3302","country_code":"PL","type":"education","lineage":["https://openalex.org/I46597724"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Krzysztof Krawiec","raw_affiliation_strings":["Institute of Computing Science, Pozna\u0144 University of Technology, Poznan, 60-965, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Computing Science, Pozna\u0144 University of Technology, Poznan, 60-965, Poland","institution_ids":["https://openalex.org/I46597724"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050968209","display_name":"Zoltan A. Kocsis","orcid":"https://orcid.org/0000-0002-5542-4156"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Zoltan A Kocsis","raw_affiliation_strings":["School of Mathematics, University of Manchester, M13 9PL, Manchester, UK"],"affiliations":[{"raw_affiliation_string":"School of Mathematics, University of Manchester, M13 9PL, Manchester, UK","institution_ids":["https://openalex.org/I28407311"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037668386"],"corresponding_institution_ids":["https://openalex.org/I52099693"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.28,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.63569719,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"20","issue":"3","first_page":"327","last_page":"350"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","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/T11975","display_name":"Evolutionary Algorithms and Applications","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/T10260","display_name":"Software Engineering Research","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9811999797821045,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.8855204582214355},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8288719654083252},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.8081624507904053},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5607523322105408},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.47493818402290344},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4060712158679962},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40334030985832214},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39963316917419434},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12584543228149414}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8855204582214355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8288719654083252},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.8081624507904053},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5607523322105408},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.47493818402290344},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4060712158679962},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40334030985832214},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39963316917419434},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12584543228149414},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10710-019-09347-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10710-019-09347-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10710-019-09347-3.pdf","source":{"id":"https://openalex.org/S47930974","display_name":"Genetic Programming and Evolvable Machines","issn_l":"1389-2576","issn":["1389-2576","1573-7632"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Genetic Programming and Evolvable Machines","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10710-019-09347-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10710-019-09347-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10710-019-09347-3.pdf","source":{"id":"https://openalex.org/S47930974","display_name":"Genetic Programming and Evolvable Machines","issn_l":"1389-2576","issn":["1389-2576","1573-7632"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Genetic Programming and Evolvable Machines","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320310935","display_name":"University of York","ror":"https://ror.org/04m01e293"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2921845636.pdf","grobid_xml":"https://content.openalex.org/works/W2921845636.grobid-xml"},"referenced_works_count":45,"referenced_works":["https://openalex.org/W141484404","https://openalex.org/W153738094","https://openalex.org/W1483736078","https://openalex.org/W1552559451","https://openalex.org/W1552659139","https://openalex.org/W1552846647","https://openalex.org/W1572652498","https://openalex.org/W1573676079","https://openalex.org/W1576818901","https://openalex.org/W1608714802","https://openalex.org/W1801849579","https://openalex.org/W1842398802","https://openalex.org/W1874450173","https://openalex.org/W1969186573","https://openalex.org/W1980900887","https://openalex.org/W1997899762","https://openalex.org/W2034068348","https://openalex.org/W2056743217","https://openalex.org/W2072473332","https://openalex.org/W2085682824","https://openalex.org/W2101565274","https://openalex.org/W2116908067","https://openalex.org/W2135326783","https://openalex.org/W2136414484","https://openalex.org/W2137469933","https://openalex.org/W2147135913","https://openalex.org/W2157096679","https://openalex.org/W2157221946","https://openalex.org/W2189687801","https://openalex.org/W2516309829","https://openalex.org/W2517534031","https://openalex.org/W2570940293","https://openalex.org/W2594171547","https://openalex.org/W2612656606","https://openalex.org/W2727601122","https://openalex.org/W3173626536","https://openalex.org/W4244792373","https://openalex.org/W4299796063","https://openalex.org/W4300805761","https://openalex.org/W6601926947","https://openalex.org/W6604968988","https://openalex.org/W6609071364","https://openalex.org/W6630460559","https://openalex.org/W6634393345","https://openalex.org/W6684985602"],"related_works":["https://openalex.org/W2378211422","https://openalex.org/W2745001401","https://openalex.org/W4321353415","https://openalex.org/W2130974462","https://openalex.org/W972276598","https://openalex.org/W4246352526","https://openalex.org/W2028665553","https://openalex.org/W2086519370","https://openalex.org/W2087343574","https://openalex.org/W1976679120"],"abstract_inverted_index":{"Stochastic":[0],"synthesis":[1,84],"of":[2,14,31,40,55],"recursive":[3,53,104],"functions":[4,54,91],"has":[5],"historically":[6],"proved":[7],"difficult,":[8],"not":[9],"least":[10],"due":[11],"to":[12,52,75],"issues":[13],"non-termination":[15],"and":[16,58,69],"the":[17,59,73,77,86],"often":[18],"ad":[19],"hoc":[20],"methods":[21],"for":[22,101],"addressing":[23],"this.":[24],"This":[25],"article":[26],"presents":[27],"a":[28,99],"general":[29],"method":[30,49,88],"implicit":[32],"recursion":[33,78],"which":[34,64],"operates":[35],"via":[36],"an":[37],"automatically-derivable":[38],"decomposition":[39],"datatype":[41],"structure":[42],"by":[43],"cases,":[44],"thereby":[45],"ensuring":[46],"well-foundedness.":[47],"The":[48],"is":[50,92],"applied":[51],"long-standing":[56],"interest":[57],"results":[60],"outperform":[61],"recent":[62],"work":[63],"combines":[65],"two":[66],"leading":[67],"approaches":[68],"employs":[70],"\u2018human":[71],"in":[72,106],"loop\u2019":[74],"define":[76],"structure.":[79],"We":[80],"show":[81],"that":[82],"stochastic":[83],"with":[85,95],"proposed":[87],"on":[89],"benchmark":[90],"effective":[93],"even":[94],"random":[96],"search,":[97],"motivating":[98],"need":[100],"more":[102],"difficult":[103],"benchmarks":[105],"future.":[107]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
