{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:39:03Z","timestamp":1767339543507,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031213137"},{"type":"electronic","value":"9783031213144"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-21314-4_1","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Project Paper: Embedding Generic Monadic Transformer into Scala"],"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"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Adam, Ghahramani, Z., Gordon, A.D.: Practical probabilistic programming with monads. SIGPLAN Not. 50(12), 165\u2013176 (2015). https:\/\/doi.org\/10.1145\/2887747.2804317","DOI":"10.1145\/2887747.2804317"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Brachth\u00e4user, J.I., Schuster, P., Ostermann, K.: Effekt: capability-passing style for type- and effect-safe, extensible effect handlers in scala. J. Funct. Program. 30, e8 (2020). https:\/\/doi.org\/10.1017\/S0956796820000027","DOI":"10.1017\/S0956796820000027"},{"key":"1_CR3","unstructured":"Brachth\u00e4user, J., Boruch-Gruszecki, A., Odersky, M.: Representing monads with capabilities. Technical report, Higher-Order Programming with Effects (HOPE) (2021). https:\/\/github.com\/lampepfl\/monadic-reflection"},{"issue":"3","key":"1_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1017\/S0956796899003342","volume":"9","author":"K Claessen","year":"1999","unstructured":"Claessen, K.: A poor man\u2019s concurrency monad. J. Funct. Program. 9(3), 313\u2013323 (1999). https:\/\/doi.org\/10.1017\/S0956796899003342","journal-title":"J. Funct. Program."},{"issue":"1\u20133","key":"1_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.scico.2004.03.004","volume":"52","author":"M Erwig","year":"2004","unstructured":"Erwig, M., Ren, D.: Monadification of functional programs. Sci. Comput. Program. 52(1\u20133), 101\u2013129 (2004). https:\/\/doi.org\/10.1016\/j.scico.2004.03.004","journal-title":"Sci. Comput. Program."},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Filinski, A.: Representing monads. In: Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1994, Association for Computing Machinery, New York, pp. 446\u2013457 (1994). https:\/\/doi.org\/10.1145\/174675.178047","DOI":"10.1145\/174675.178047"},{"key":"1_CR7","unstructured":"Haller, P., Lightbend: scala-async (2013). https:\/\/github.com\/scala-async\/scala-async"},{"key":"1_CR8","unstructured":"Haller, P., Miller, H.: A formal model for direct-style asynchronous observables. CoRR abs\/1511.00511 (2015). http:\/\/arxiv.org\/abs\/1511.00511"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Hatcliff, J., Danvy, O.: A generic account of continuation-passing styles. In: Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1994, Association for Computing Machinery, New York, pp. 458\u2013471 (1994). https:\/\/doi.org\/10.1145\/174675.178053","DOI":"10.1145\/174675.178053"},{"key":"1_CR10","unstructured":"Hoare, C.: Communicating Sequential Processes. Prentice-Hall International Series in Computer Science, Prentice Hall (1985). http:\/\/www.usingcsp.com\/cspbook.pdf"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Hudak, P.: Building domain-specific embedded languages. ACM Comput. Surv. 28(4es), 196-es (1996). https:\/\/doi.org\/10.1145\/242224.242477","DOI":"10.1145\/242224.242477"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Kiselyov, O., Shan, C.c., Friedman, D.P., Sabry, A.: Backtracking, interleaving, and terminating monad transformers: (functional pearl). SIGPLAN Not. 40(9), 192\u2013203 (2005). https:\/\/doi.org\/10.1145\/1090189.1086390","DOI":"10.1145\/1090189.1086390"},{"key":"1_CR13","unstructured":"Oracle: Project loom (2018\u20132022). https:\/\/openjdk.java.net\/projects\/loom\/"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Petricek, T., Syme, D.: The F# computation expression zoo. In: Proceedings of Practical Aspects of Declarative Languages. PADL 2014 (2014)","DOI":"10.1007\/978-3-319-04132-2_3"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Prokopec, A., Liu, F.: Theory and practice of coroutines with snapshots. In: Millstein, T. (ed.) 32nd European Conference on Object-Oriented Programming (ECOOP 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol. 109, pp. 3:1\u20133:32. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ECOOP.2018.3, http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2018\/9208","DOI":"10.4230\/LIPIcs.ECOOP.2018.3"},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10990-013-9096-9","volume":"25","author":"T Rompf","year":"2013","unstructured":"Rompf, T., Amin, N., Moors, A., Haller, P., Odersky, M.: Scala-virtualized: linguistic reuse for deep embeddings. High.-Order Symbolic Comput. 25(1), 165\u2013207 (2013). https:\/\/doi.org\/10.1007\/s10990-013-9096-9","journal-title":"High.-Order Symbolic Comput."},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Rompf, T., Maier, I., Odersky, M.: Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform. In: Hutton, G., Tolmach, A.P. (eds.) Proceeding of the 14th ACM SIGPLAN International Conference on Functional programming, ICFP 2009, Edinburgh, Scotland, UK, 31 August\u20132 September, 2009, pp. 317\u2013328. ACM (2009). https:\/\/doi.org\/10.1145\/1596550.1596596","DOI":"10.1145\/1596550.1596596"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Syme, D.: The early history of F#. Proc. ACM Program. Lang. 4(HOPL) (2020). https:\/\/doi.org\/10.1145\/3386325","DOI":"10.1145\/3386325"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Wadler, P., Thiemann, P.: The marriage of effects and monads. ACM Trans. Comput. Logic 4(1), 1\u201332 (Jan 2003). https:\/\/doi.org\/10.1145\/601775.601776","DOI":"10.1145\/601775.601776"}],"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-21314-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T06:01:04Z","timestamp":1672552864000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21314-4_1"}},"subtitle":["Can We Merge Monadic Programming into Mainstream?"],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031213137","9783031213144"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21314-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tfp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/trendsfp.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}