{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T23:04:44Z","timestamp":1777590284343,"version":"3.51.4"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032104762","type":"print"},{"value":"9783032104779","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-032-10477-9_3","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:43:45Z","timestamp":1767314625000},"page":"33-46","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Merging Logic and\u00a0the\u00a0Coinductive Selection Monad: Mixing Machine Learning Into Logical Search"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1554-2019","authenticated-orcid":false,"given":"Ruslan","family":"Shevchenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8435-1451","authenticated-orcid":false,"given":"Anatoliy","family":"Doroshenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4700-6704","authenticated-orcid":false,"given":"Olena","family":"Yatsenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7889-1888","authenticated-orcid":false,"given":"Alexander","family":"Nemish","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"3_CR1","unstructured":"Deep java library. https:\/\/djl.ai\/"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Abadi, M., Plotkin, G.: Smart choices and the selection monad. Log. Methods Comput. Sci. 19(2), 3 (2023). https:\/\/doi.org\/10.46298\/lmcs-19(2:3)2023, https:\/\/lmcs.episciences.org\/8372","DOI":"10.46298\/lmcs-19(2:3)2023"},{"key":"3_CR3","unstructured":"Carbune, V., Coppey, T., Daryin, A., Deselaers, T., Sarda, N., Yagnik, J.: Smartchoices: hybridizing programming and machine learning (2019). https:\/\/arxiv.org\/abs\/1810.00619"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Chakravarty, M.M.T., Chapman, J., MacKenzie, K., Melkonian, O., Peyton Jones, M., Wadler, P.: The extended UTXO model. In: Bernhard, M., et al. (eds.) Financial Cryptography and Data Security. FC 2020. LNCS, vol. 12063, pp. 525\u2013539. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-54455-3_37","DOI":"10.1007\/978-3-030-54455-3_37"},{"issue":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/202530.202534","volume":"30","author":"C Click","year":"1995","unstructured":"Click, C., Paleczny, M.: A simple graph-based intermediate representation. SIGPLAN Not. 30(3), 35\u201349 (1995). https:\/\/doi.org\/10.1145\/202530.202534","journal-title":"SIGPLAN Not."},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Eisner, J., Goldlust, E., Smith, N.A.: Compiling comp ling: practical weighted dynamic programming and the dyna language. In: Proceedings of the Conference on Human Language Technology and Empirical Methods in Natural Language Processing, pp. 281\u2013290. HLT \u201905, Association for Computational Linguistics, USA (2005). https:\/\/doi.org\/10.3115\/1220575.1220611","DOI":"10.3115\/1220575.1220611"},{"key":"3_CR7","unstructured":"Golovin, D., et al.: Smartchoices: augmenting software with learned implementations (2024). https:\/\/arxiv.org\/abs\/2304.13033"},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1017\/S0956796805005769","volume":"16","author":"R Hinze","year":"2006","unstructured":"Hinze, R., Paterson, R.: Finger trees: a simple general-purpose data structure. J. Funct. Program. 16(2), 197\u2013217 (2006). https:\/\/doi.org\/10.1017\/S0956796805005769","journal-title":"J. Funct. Program."},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Kiselyov, O., Shan, C.c., Friedman, D.P., Sabry, A.: Backtracking, interleaving, and terminating monad transformers: (functional pearl). In: Proceedings of the Tenth ACM SIGPLAN International Conference on Functional Programming, pp. 192\u2013203. ICFP \u201905, Association for Computing Machinery, New York, NY, USA (2005). https:\/\/doi.org\/10.1145\/1086365.1086390","DOI":"10.1145\/1086365.1086390"},{"key":"3_CR10","unstructured":"Lago, U.D., Gavazzo, F., Ghyselen, A.: On reinforcement learning, effect handlers, and the state monad (2022). https:\/\/arxiv.org\/abs\/2203.15426"},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Ploeg, A.V.D., Kiselyov, O.: Reflection without remorse: revealing a hidden sequence to speed up monadic reflection. In: Proceedings of the 2014 ACM SIGPLAN Symposium on Haskell, pp. 133\u2013144. Haskell \u201914, Association for Computing Machinery, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2633357.2633360","DOI":"10.1145\/2633357.2633360"},{"key":"3_CR12","unstructured":"Shevchenko, R.: Cpslogicmonad. https:\/\/github.com\/dotty-cps-async\/dotty-cps-async\/tree\/master\/logic"},{"key":"3_CR13","unstructured":"Shevchenko, R.: Monadic interface for reinforcement learning. https:\/\/github.com\/dotty-cps-async\/rl-monad"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Shevchenko, R.: Project paper: embedding generic monadic transformer into scala. In: Swierstra, W., Wu, N. (eds.) Trends in Functional Programming. TFP 2022. LNCS, vol. 13401, pp. 1\u201317. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-21314-4_1","DOI":"10.1007\/978-3-031-21314-4_1"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Shevchenko, R., Doroshenko, A., Yatsenko, O.: Embedding a family of logic languages with custom monadic unification in scala. Probl. Program. 2024(1) (2024). https:\/\/doi.org\/10.15407\/pp2024.01.003, https:\/\/pp.isofts.kiev.ua\/ojs1\/article\/view\/601","DOI":"10.15407\/pp2024.01.003"},{"key":"3_CR16","unstructured":"Team, L.: Scalus. https:\/\/scalus.org"},{"key":"3_CR17","unstructured":"Team, P.C.: Formal specification of the plutus core language. https:\/\/plutus.cardano.intersectmbo.org\/resources\/plutus-core-spec.pdf"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Wadler, P.: Monads for functional programming. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol. 925, pp. 24\u201352. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59451-5_2","DOI":"10.1007\/3-540-59451-5_2"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, J., Wang, X., Zhang, H., Sun, H., Wang, K., Liu, X.: A novel neural source code representation based on abstract syntax tree. In: Proceedings of the 41st International Conference on Software Engineering, pp. 783\u2013794. IEEE Press (2019)","DOI":"10.1109\/ICSE.2019.00086"}],"container-title":["Communications in Computer and Information Science","Information and Communication Technologies in Education, Research, and Industrial Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-10477-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:43:47Z","timestamp":1767314627000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-10477-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032104762","9783032104779"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-10477-9_3","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ICTERI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information and Communication Technologies in Education, Research, and Industrial Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"1 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icteri2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icteri.org\/icteri-2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}