{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T20:23:47Z","timestamp":1764361427173,"version":"3.46.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031997501"},{"type":"electronic","value":"9783031997518"}],"license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-031-99751-8_15","type":"book-chapter","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T01:15:57Z","timestamp":1759281357000},"page":"359-377","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Synthesizing Accumulative Functions Via Program Transformation"],"prefix":"10.1007","author":[{"given":"Junyu","family":"Lin","sequence":"first","affiliation":[]},{"given":"Akimasa","family":"Morihata","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Albarghouthi, A., Gulwani, S., Kincaid, Z.: Recursive program synthesis. In: Sharygina, N., Veith, H. (eds.) Computer Aided Verification: 25th International Conference, pp. 934\u2013950. CAV 2013, Saint Petersburg, Russia (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_67","DOI":"10.1007\/978-3-642-39799-8_67"},{"issue":"4","key":"15_CR2","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1145\/1780.1781","volume":"6","author":"RS Bird","year":"1984","unstructured":"Bird, R.S.: The promotion and accumulation strategies in transformational programming. ACM Trans. Program. Lang. Syst. 6(4), 487\u2013504 (1984). https:\/\/doi.org\/10.1145\/1780.1781","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"15_CR3","doi-asserted-by":"publisher","unstructured":"Burstall, R.M., Darlington, J.: A transformation system for developing recursive programs. J. ACM 24(1), 44\u201367 (1977). https:\/\/doi.org\/10.1145\/321992.321996","DOI":"10.1145\/321992.321996"},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0022-0000(85)90066-2","volume":"31","author":"J Engelfriet","year":"1985","unstructured":"Engelfriet, J., Vogler, H.: Macro tree transducers. J. Comput. Syst. Sci. 31(1), 71\u2013146 (1985). https:\/\/doi.org\/10.1016\/0022-0000(85)90066-2","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(91)90353-4","volume":"78","author":"J Engelfriet","year":"1991","unstructured":"Engelfriet, J., Vogler, H.: Modular tree transducers. Theoret. Comput. Sci. 78(2), 267\u2013303 (1991). https:\/\/doi.org\/10.1016\/0304-3975(91)90353-4","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR6","doi-asserted-by":"publisher","unstructured":"Farzan, A., Nicolet, V.: Counterexample-guided partial bounding for recursive function synthesis. In: Silva, A., Leino, K.R.M. (eds.) Computer Aided Verification: 33rd International Conference. CAV 2021, vol. 12759, pp. 832\u2013855. Virtual Event (2021). https:\/\/doi.org\/10.1007\/978-3-030-81685-8_39","DOI":"10.1007\/978-3-030-81685-8_39"},{"key":"15_CR7","unstructured":"Gill, A.J.: Cheap deforestation for non-strict functional languages. Ph.D. thesis, University of Glasgow (1996)"},{"key":"15_CR8","doi-asserted-by":"publisher","unstructured":"Hong, Q., Aiken, A.: Recursive Program Synthesis using Paramorphisms. In: Proceedings of the ACM on Programming Languages. PLDI, vol.\u00a08, pp. 102\u2013125 (2024). https:\/\/doi.org\/10.1145\/3656381","DOI":"10.1145\/3656381"},{"issue":"2","key":"15_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF03037434","volume":"17","author":"Z Hu","year":"1999","unstructured":"Hu, Z., Iwasaki, H., Takeichi, M.: Calculating Accumulations. New Gener. Comput. 17(2), 153\u2013173 (1999). https:\/\/doi.org\/10.1007\/BF03037434","journal-title":"New Gener. Comput."},{"key":"15_CR10","doi-asserted-by":"publisher","unstructured":"Hughes, R.J.M.: A novel representation of lists and its application to the function \u201creverse.\u201d Inf. Process. Lett. 22(3), 141\u2013144 (1986). https:\/\/doi.org\/10.1016\/0020-0190(86)90059-1","DOI":"10.1016\/0020-0190(86)90059-1"},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"Itzhaky, S., Peleg, H., Polikarpova, N., Rowe, R.N.S., Sergey, I.: Cyclic program synthesis. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, pp. 944\u2013959 (2021). https:\/\/doi.org\/10.1145\/3453483.3454087","DOI":"10.1145\/3453483.3454087"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/3-540-45127-7_13","volume-title":"Rewriting Techniques and Applications","author":"A K\u00fchnemann","year":"2001","unstructured":"K\u00fchnemann, A., Gl\u00fcck, R., Kakehi, K.: Relating accumulative and non-accumulative functional programs. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol. 2051, pp. 154\u2013168. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45127-7_13"},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"Lee, W., Cho, H.: Inductive synthesis of structurally recursive functional programs from non-recursive expressions. In: Proceedings of the ACM on Programming Languages. POPL, vol.\u00a07, pp. 2048\u20132078 (2023). https:\/\/doi.org\/10.1145\/3571263","DOI":"10.1145\/3571263"},{"key":"15_CR14","doi-asserted-by":"publisher","unstructured":"Lubin, J., Collins, N., Omar, C., Chugh, R.: Program sketching with live bidirectional evaluation. In: Proceedings of the ACM on Programming Languages. ICFP, vol.\u00a04, pp. 1\u201329 (2020). https:\/\/doi.org\/10.1145\/3408991","DOI":"10.1145\/3408991"},{"key":"15_CR15","doi-asserted-by":"publisher","unstructured":"Miltner, A., Nu\u00f1ez, A.T., Brendel, A., Chaudhuri, S., Dillig, I.: Bottom-up synthesis of recursive functional programs using angelic execution. In: Proceedings of the ACM on Programming Languages. POPL, vol.\u00a06, pp. 1\u201329 (2022). https:\/\/doi.org\/10.1145\/3498682","DOI":"10.1145\/3498682"},{"key":"15_CR16","doi-asserted-by":"publisher","unstructured":"Osera, P.M., Zdancewic, S.: Type-and-example-directed program synthesis. In: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 619\u2013630 (2015). https:\/\/doi.org\/10.1145\/2737924.2738007","DOI":"10.1145\/2737924.2738007"},{"issue":"2","key":"15_CR17","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1145\/234528.234529","volume":"28","author":"A Pettorossi","year":"1996","unstructured":"Pettorossi, A., Proietti, M.: Rules and strategies for transforming functional and logic programs. ACM Comput. Surv. 28(2), 360\u2013414 (1996). https:\/\/doi.org\/10.1145\/234528.234529","journal-title":"ACM Comput. Surv."},{"key":"15_CR18","doi-asserted-by":"publisher","unstructured":"Voigtl\u00e4nder, J.: Concatenate, reverse and map vanish for free. In: Wand, M., Jones, S.L.P. (eds.) Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming, pp. 14\u201325. ICFP (2002). https:\/\/doi.org\/10.1145\/581478.581481","DOI":"10.1145\/581478.581481"},{"key":"15_CR19","unstructured":"Wadler, P.: The Concatenate Vanishes. Glasgow University, Dept of Computer Science (1987)"},{"issue":"2","key":"15_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"73","author":"P Wadler","year":"1990","unstructured":"Wadler, P.: Deforestation: transforming programs to eliminate trees. Theor. Comput. Sci. 73(2), 231\u2013248 (1990). https:\/\/doi.org\/10.1016\/0304-3975(90)90147-A","journal-title":"Theor. Comput. Sci."},{"key":"15_CR21","doi-asserted-by":"publisher","unstructured":"Yuan, Y., Radhakrishna, A., Samanta, R.: Trace-guided inductive synthesis of recursive functional programs. In: Proceedings of the ACM on Programming Languages. PLDI, vol.\u00a07, pp. 860\u2013883 (2023). https:\/\/doi.org\/10.1145\/3591255","DOI":"10.1145\/3591255"}],"container-title":["Lecture Notes in Computer Science","Trends in Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-99751-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T20:22:07Z","timestamp":1764361327000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-99751-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"ISBN":["9783031997501","9783031997518"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-99751-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,1]]},"assertion":[{"value":"1 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TFP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Trends in Functional Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tfp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/trendsfp.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}