{"id":"https://openalex.org/W4413469794","doi":"https://doi.org/10.1017/s0956796825100063","title":"Inductive synthesis of structurally recursive functional programs from non-recursive expressions","display_name":"Inductive synthesis of structurally recursive functional programs from non-recursive expressions","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4413469794","doi":"https://doi.org/10.1017/s0956796825100063"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796825100063","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796825100063","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2BA53AFECEAB119C9E5439BC656BCDC3/S0956796825100063a.pdf/div-class-title-inductive-synthesis-of-structurally-recursive-functional-programs-from-non-recursive-expressions-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2BA53AFECEAB119C9E5439BC656BCDC3/S0956796825100063a.pdf/div-class-title-inductive-synthesis-of-structurally-recursive-functional-programs-from-non-recursive-expressions-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012388251","display_name":"Hangyeol Cho","orcid":"https://orcid.org/0000-0001-5869-9473"},"institutions":[{"id":"https://openalex.org/I4575257","display_name":"Hanyang University","ror":"https://ror.org/046865y68","country_code":"KR","type":"education","lineage":["https://openalex.org/I4575257"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"HANGYEOL CHO","raw_affiliation_strings":["Hanyang University"],"affiliations":[{"raw_affiliation_string":"Hanyang University","institution_ids":["https://openalex.org/I4575257"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076120088","display_name":"Woosuk Lee","orcid":"https://orcid.org/0000-0002-1884-619X"},"institutions":[{"id":"https://openalex.org/I4575257","display_name":"Hanyang University","ror":"https://ror.org/046865y68","country_code":"KR","type":"education","lineage":["https://openalex.org/I4575257"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"WOOSUK LEE","raw_affiliation_strings":["Hanyang University"],"affiliations":[{"raw_affiliation_string":"Hanyang University","institution_ids":["https://openalex.org/I4575257"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5012388251"],"corresponding_institution_ids":["https://openalex.org/I4575257"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.32176503,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"35","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10260","display_name":"Software Engineering Research","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T10260","display_name":"Software Engineering Research","score":0.9991000294685364,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9958999752998352,"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.8686747550964355},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8626400828361511},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.7187118530273438},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.6408553719520569},{"id":"https://openalex.org/keywords/recursive-functions","display_name":"Recursive functions","score":0.5777408480644226},{"id":"https://openalex.org/keywords/program-synthesis","display_name":"Program synthesis","score":0.554929792881012},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5461410880088806},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.5217134356498718},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4528924822807312},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43635767698287964},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4007553160190582},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.24221229553222656},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1091805100440979},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.07329124212265015}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8686747550964355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8626400828361511},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7187118530273438},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6408553719520569},{"id":"https://openalex.org/C2982939207","wikidata":"https://www.wikidata.org/wiki/Q1175101","display_name":"Recursive functions","level":2,"score":0.5777408480644226},{"id":"https://openalex.org/C2776937632","wikidata":"https://www.wikidata.org/wiki/Q4117718","display_name":"Program synthesis","level":2,"score":0.554929792881012},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5461410880088806},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.5217134356498718},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4528924822807312},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43635767698287964},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4007553160190582},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.24221229553222656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1091805100440979},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.07329124212265015},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0956796825100063","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796825100063","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2BA53AFECEAB119C9E5439BC656BCDC3/S0956796825100063a.pdf/div-class-title-inductive-synthesis-of-structurally-recursive-functional-programs-from-non-recursive-expressions-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s0956796825100063","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796825100063","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2BA53AFECEAB119C9E5439BC656BCDC3/S0956796825100063a.pdf/div-class-title-inductive-synthesis-of-structurally-recursive-functional-programs-from-non-recursive-expressions-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1510316451","display_name":null,"funder_award_id":"2021R1A5","funder_id":"https://openalex.org/F4320328359","funder_display_name":"Ministry of Science and ICT, South Korea"},{"id":"https://openalex.org/G3034753964","display_name":null,"funder_award_id":"grant","funder_id":"https://openalex.org/F4320320671","funder_display_name":"National Research Foundation"},{"id":"https://openalex.org/G3071639259","display_name":null,"funder_award_id":"2021R1","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G342704958","display_name":null,"funder_award_id":"funded","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G4447486136","display_name":null,"funder_award_id":"2021R1A5A1021944","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G4700831490","display_name":null,"funder_award_id":"2022-","funder_id":"https://openalex.org/F4320335489","funder_display_name":"Institute for Information and Communications Technology Promotion"},{"id":"https://openalex.org/G5622424243","display_name":null,"funder_award_id":"RS-2024-00341722","funder_id":"https://openalex.org/F4320335489","funder_display_name":"Institute for Information and Communications Technology Promotion"},{"id":"https://openalex.org/G6072120315","display_name":null,"funder_award_id":"funded","funder_id":"https://openalex.org/F4320335489","funder_display_name":"Institute for Information and Communications Technology Promotion"},{"id":"https://openalex.org/G7369723383","display_name":null,"funder_award_id":"2021R1A5A1021944","funder_id":"https://openalex.org/F4320328359","funder_display_name":"Ministry of Science and ICT, South Korea"}],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"},{"id":"https://openalex.org/F4320328359","display_name":"Ministry of Science and ICT, South Korea","ror":"https://ror.org/01wpjm123"},{"id":"https://openalex.org/F4320335489","display_name":"Institute for Information and Communications Technology Promotion","ror":"https://ror.org/01g0hqq23"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4413469794.pdf","grobid_xml":"https://content.openalex.org/works/W4413469794.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1858945639","https://openalex.org/W1905591175","https://openalex.org/W2060610732","https://openalex.org/W2091385303","https://openalex.org/W2093535699","https://openalex.org/W2144951274","https://openalex.org/W2263738566","https://openalex.org/W2765742677","https://openalex.org/W2895712452","https://openalex.org/W2897229241","https://openalex.org/W2962809971","https://openalex.org/W2963218353","https://openalex.org/W3006444925","https://openalex.org/W3009002422","https://openalex.org/W3046985528","https://openalex.org/W3101627445","https://openalex.org/W3117975267","https://openalex.org/W3173363254","https://openalex.org/W3174357804","https://openalex.org/W3177832995","https://openalex.org/W3185895498","https://openalex.org/W4229675450","https://openalex.org/W4237412827","https://openalex.org/W4315606149","https://openalex.org/W4379512371","https://openalex.org/W4399850818","https://openalex.org/W4400995520","https://openalex.org/W6681601506","https://openalex.org/W6745616896"],"related_works":["https://openalex.org/W4245260434","https://openalex.org/W2368379187","https://openalex.org/W1596057910","https://openalex.org/W1972801935","https://openalex.org/W4244587112","https://openalex.org/W4247266364","https://openalex.org/W4252376252","https://openalex.org/W252215219","https://openalex.org/W4239583161","https://openalex.org/W2790438970"],"abstract_inverted_index":{"Abstract":[0],"We":[1,36,69,144],"present":[2,121],"a":[3,15,42,53,66,112,122,134,138,150],"novel":[4],"approach":[5,148],"to":[6,52,132],"synthesizing":[7],"recursive":[8,16,21,88,139],"functional":[9],"programs":[10],"from":[11,65,160],"input\u2013output":[12,79,127],"examples.":[13],"Synthesizing":[14],"function":[17,29],"is":[18,100],"challenging":[19],"because":[20],"subexpressions":[22],"should":[23],"be":[24],"constructed":[25],"while":[26],"the":[27,85,96,142],"target":[28],"has":[30],"not":[31],"been":[32],"fully":[33],"defined":[34],"yet.":[35],"address":[37],"this":[38],"challenge":[39],"by":[40],"using":[41,141],"new":[43,165],"technique":[44],"we":[45,83,120],"call":[46],"block-based":[47],"pruning.":[48],"A":[49],"block":[50],"refers":[51],"recursion-":[54],"and":[55,81,154,163],"conditional-free":[56],"expression":[57],"(i.e.,":[58],"straight-line":[59],"code)":[60],"that":[61,92,124,170],"yields":[62],"an":[63,103],"output":[64],"particular":[67],"input.":[68],"first":[70],"synthesize":[71],"as":[72,75],"many":[73],"blocks":[74],"possible":[76],"for":[77,137],"each":[78],"example,":[80],"then":[82],"explore":[84],"space":[86,106],"of":[87,116,129],"programs,":[89],"pruning":[90],"candidates":[91],"are":[93],"inconsistent":[94],"with":[95,111],"blocks.":[97,117],"Our":[98,167],"method":[99,123],"based":[101],"on":[102,157,164],"efficient":[104],"version":[105],"learning,":[107],"thereby":[108],"effectively":[109],"dealing":[110],"possibly":[113],"enormous":[114],"number":[115],"In":[118],"addition,":[119],"uses":[125],"sampled":[126],"behaviors":[128],"library":[130],"functions":[131],"enable":[133],"goal-directed":[135],"search":[136],"program":[140],"library.":[143],"have":[145],"implemented":[146],"our":[147],"in":[149],"system":[151],"called":[152],"Trio":[153,171],"evaluated":[155],"it":[156],"synthesis":[158],"tasks":[159],"prior":[161,174],"work":[162],"tasks.":[166],"experiments":[168],"show":[169],"significantly":[172],"outperforms":[173],"work.":[175]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}