{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T20:24:09Z","timestamp":1764361449707,"version":"3.46.0"},"publisher-location":"Cham","reference-count":10,"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_14","type":"book-chapter","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T01:17:02Z","timestamp":1759281422000},"page":"329-355","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Two-Dimensional Numerical Representations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-4214-2245","authenticated-orcid":false,"given":"Michael","family":"Youssef","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Hinze, R.: Manufacturing datatypes. J. Funct. Program. 11, 493\u2013524 (2001). https:\/\/doi.org\/10.1017\/S095679680100404X","DOI":"10.1017\/S095679680100404X"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Hinze, R., Swierstra, W.: Calculating datastructures. In: Mathematics of Program Construction: 14th International Conference, MPC 2022, Tbilisi, Georgia, September 26\u201328, 2022, Proceedings, pp. 62\u2013101. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-16912-0_3","DOI":"10.1007\/978-3-031-16912-0_3"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Kaldewaij, A., Dielissen, V.J.: Leaf trees. Sci. Comput. Program. 26(1\u20133), 149\u2013165 (1996). https:\/\/doi.org\/10.1016\/0167-6423(95)00026-7","DOI":"10.1016\/0167-6423(95)00026-7"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput. 110, 214\u2013225 (1991). https:\/\/doi.org\/10.1109\/LICS.1991.151646","DOI":"10.1109\/LICS.1991.151646"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Lehmann, D.J.: Algebraic structures for transitive closure. Theoretical Comput. Sci. 4(1), 59\u201376 (1977). https:\/\/doi.org\/10.1016\/0304-3975(77)90056-1","DOI":"10.1016\/0304-3975(77)90056-1"},{"issue":"5","key":"14_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0020-0190(83)90106-0","volume":"17","author":"EW Myers","year":"1983","unstructured":"Myers, E.W.: An applicative random-access stack. Inf. Process. Lett. 17(5), 241\u2013248 (1983). https:\/\/doi.org\/10.1016\/0020-0190(83)90106-0","journal-title":"Inf. Process. Lett."},{"key":"14_CR7","unstructured":"Norell, U.: Towards a practical programming language based on dependent type theory. Ph.D. thesis, Chalmers University of Technology and G\u00f6teborg University (2007). https:\/\/research.chalmers.se\/en\/publication\/46311"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Okasaki, C.: From fast exponentiation to square matrices: an adventure in types. In: Proceedings of the Fourth ACM SIGPLAN International Conference on Functional Programming, ICFP \u201999, pp. 28\u201335. Association for Computing Machinery, New York (1999). https:\/\/doi.org\/10.1145\/317636.317781","DOI":"10.1145\/317636.317781"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Okasaki, C.: Purely Functional Data Structures. Cambridge University Press, USA (1999). https:\/\/doi.org\/10.1017\/CBO9780511530104","DOI":"10.1017\/CBO9780511530104"},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Sandberg\u00a0Eriksson, A., Jansson, P.: An Agda formalisation of the transitive closure of block matrices (extended abstract). In: Proceedings of the 1st International Workshop on Type-Driven Development, TyDe 2016, pp. 60\u201361. Association for Computing Machinery, New York (2016). https:\/\/doi.org\/10.1145\/2976022.2976025","DOI":"10.1145\/2976022.2976025"}],"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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T20:22:22Z","timestamp":1764361342000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-99751-8_14"}},"subtitle":["An Adventure with Block Matrices"],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"ISBN":["9783031997501","9783031997518"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-99751-8_14","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"}}]}}