{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T21:18:21Z","timestamp":1764364701189,"version":"3.40.3"},"publisher-location":"Cham","reference-count":5,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031745577"},{"type":"electronic","value":"9783031745584"}],"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-031-74558-4_3","type":"book-chapter","created":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T04:35:09Z","timestamp":1736397309000},"page":"55-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Towards a\u00a0More Efficient Selection Monad"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Hartmann","sequence":"first","affiliation":[]},{"given":"Tom","family":"Schrijvers","sequence":"additional","affiliation":[]},{"given":"Jeremy","family":"Gibbons","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,10]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1017\/S0960129509990351","volume":"20","author":"M Escard\u00f3","year":"2010","unstructured":"Escard\u00f3, M., Oliva, P.: Selection functions, bar recursion and backward induction. Math. Struct. Comput. Sci. 20(2), 127\u2013168 (2010)","journal-title":"Math. Struct. Comput. Sci."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Escard\u00f3, M., Oliva, P.: What sequential games, the Tychonoff Theorem and the double-negation shift have in common. In: Proceedings of the third ACM SIGPLAN workshop on Mathematically Structured Functional Programming, pp. 21\u201332 (2010)","DOI":"10.1145\/1863597.1863605"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-031-21314-4_7","volume-title":"Trends in Functional Programming: 23rd International Symposium, TFP 2022, Virtual Event, March 17\u201318, 2022, Revised Selected Papers","author":"J Hartmann","year":"2022","unstructured":"Hartmann, J., Gibbons, J.: Algorithm design with\u00a0the\u00a0selection monad. In: Swierstra, W., Wu, N. (eds.) Trends in Functional Programming: 23rd International Symposium, TFP 2022, Virtual Event, March 17\u201318, 2022, Revised Selected Papers, pp. 126\u2013143. Springer International Publishing, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-21314-4_7"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Hedges, J.: Monad transformers for backtracking search. In: Levy, P.B., Krishnaswami, N. (eds.) Mathematically Structured Functional Programming. EPTCS, vol.\u00a0153, pp. 31\u201350 (2014)","DOI":"10.4204\/EPTCS.153.3"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Theorems for free! In: Proceedings of the Fourth International Conference on Functional Programming Languages and Computer Architecture, pp. 347\u2013359 (1989)","DOI":"10.1145\/99370.99404"}],"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-74558-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T05:03:26Z","timestamp":1736399006000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74558-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031745577","9783031745584"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74558-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"10 January 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":"South Orange, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 January 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tfp2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}