{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T16:30:26Z","timestamp":1775061026700,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032224682","type":"print"},{"value":"9783032224699","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-032-22469-9_3","type":"book-chapter","created":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:57:42Z","timestamp":1775055462000},"page":"41-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fan-Causality and\u00a0Uniform Continuity on\u00a0Final Coalgebras"],"prefix":"10.1007","author":[{"given":"Henning","family":"Basold","sequence":"first","affiliation":[]},{"given":"Tanjona","family":"Ralaivaosaona","sequence":"additional","affiliation":[]},{"given":"Jurriaan","family":"Rot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,2]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Abel, A., Pientka, B.: Wellfounded recursion with copatterns: a unified approach to termination and productivity. In: ICFP, pp. 185\u2013196 (2013). https:\/\/doi.org\/10.1145\/2500365.2500591","DOI":"10.1145\/2500365.2500591"},{"key":"3_CR2","unstructured":"Ad\u00e1mek, J.: Free algebras and automata realizations in the language of categories. Commentationes Mathematicae Universitatis Carolinae 015(4), 589\u2013602 (1974), https:\/\/eudml.org\/doc\/16649"},{"issue":"1\/2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(01)00240-7","volume":"294","author":"J Ad\u00e1mek","year":"2003","unstructured":"Ad\u00e1mek, J.: On final coalgebras of continuous functors. Theor. Comput. Sci. 294(1\/2), 3\u201329 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(01)00240-7","journal-title":"Theor. Comput. Sci."},{"key":"3_CR4","unstructured":"ANSYS: ANSYS SCADE Suite: Model-Based Development (2019). https:\/\/www.ansys.com\/products\/embedded-software\/ansys-scade-suite"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Atkey, R., McBride, C.: Productive coprogramming with guarded recursion. In: ICFP, pp. 197\u2013208. ACM (2013). https:\/\/doi.org\/10.1145\/2500365.2500597","DOI":"10.1145\/2500365.2500597"},{"issue":"4","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2501654.2501666","volume":"45","author":"E Bainomugisha","year":"2013","unstructured":"Bainomugisha, E., Carreton, A.L., Cutsem, T.V., Mostinckx, S., Meuter, W.D.: A survey on reactive programming. ACM Comput. Surv. 45(4), 1\u201334 (2013). https:\/\/doi.org\/10.1145\/2501654.2501666","journal-title":"ACM Comput. Surv."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Basold, H., Bonsangue, M., Hansen, H.H., Rutten, J.: (co) algebraic characterizations of signal flow graphs. In: Horizons of the Mind. A Tribute to Prakash Panangaden: Essays Dedicated to Prakash Panangaden on the Occasion of His 60th Birthday, pp. 124\u2013145. Springer (2014)","DOI":"10.1007\/978-3-319-06880-0_6"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Basold, H., Pous, D., Rot, J.: Monoidal company for accessible functors. In: CALCO 2017. LIPIcs, vol.\u00a072, pp. 5:1\u20135:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CALCO.2017.5","DOI":"10.4230\/LIPIcs.CALCO.2017.5"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Basold, H., Ralaivaosaona, T.: Composition and recursion for causal structures. In: Baldan, P., de Paiva, V. (eds.) Proceedings of CALCO 2023. LIPIcs, vol.\u00a0270, pp. 18:1\u201318:17. Schloss Dagstuhl (2023). https:\/\/doi.org\/10.4230\/LIPIcs.CALCO.2023.18","DOI":"10.4230\/LIPIcs.CALCO.2023.18"},{"issue":"4","key":"3_CR10","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1017\/jsl.2018.49","volume":"83","author":"J Berger","year":"2018","unstructured":"Berger, J., Svindland, G.: Brouwer\u2019s fan theorem and convexity. J. Symbolic Logic 83(4), 1363\u20131375 (2018)","journal-title":"J. Symbolic Logic"},{"key":"3_CR11","volume-title":"Handbook of Categorical Algebra:","author":"F Borceux","year":"2008","unstructured":"Borceux, F.: Handbook of Categorical Algebra:, vol. 1. Cambridge University Press (Apr, Basic Category Theory (2008)"},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Cook, D.S., Weiss, I.: The topology of a quantale valued metric space. Fuzzy Sets Syst. 406, 42\u201357 (2021). https:\/\/doi.org\/10.1016\/j.fss.2020.06.005","DOI":"10.1016\/j.fss.2020.06.005"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Danielsson, N.A.: Up-to techniques using sized types. In: Proceedings of the ACM on Programming Languages 2(POPL), 43:1\u201343:28 (2017). https:\/\/doi.org\/10.1145\/3158131","DOI":"10.1145\/3158131"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge, 2 edn. (2002). https:\/\/doi.org\/10.1017\/CBO9780511809088","DOI":"10.1017\/CBO9780511809088"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1006\/aima.1997.1649","volume":"129","author":"B Day","year":"1997","unstructured":"Day, B., Street, R.: Monoidal Bicategories and Hopf Algebroids. Adv. Math. 129(1), 99\u2013157 (1997). https:\/\/doi.org\/10.1006\/aima.1997.1649","journal-title":"Adv. Math."},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Day, B., Street, R.: Lax monoids, pseudo-operads, and convolution. In: Diagrammatic Morphisms and Applications (San Francisco, CA, 2000), Contemp. Math., vol.\u00a0318, pp. 75\u201396. Amer. Math. Soc., Providence, RI (2003). https:\/\/doi.org\/10.1090\/conm\/318\/05545","DOI":"10.1090\/conm\/318\/05545"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Flagg, R.: Quantales and continuity spaces. Algebra Univ. 37(3), 257\u2013276 (1997). https:\/\/doi.org\/10.1007\/s000120050018","DOI":"10.1007\/s000120050018"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Gebler, D., Tini, S.: SOS specifications for uniformly continuous operators. J. Comput. Syst. Sci. 92, 113\u2013151 (Mar 2018). https:\/\/doi.org\/10.1016\/j.jcss.2017.09.011","DOI":"10.1016\/j.jcss.2017.09.011"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Ghani, N., Hancock, P., Pattinson, D.: Continuous functions on final coalgebras. Electr. Notes Theor. Comput. Sci. 249, 3\u201318 (2009). https:\/\/doi.org\/10.1016\/j.entcs.2009.07.081","DOI":"10.1016\/j.entcs.2009.07.081"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Ghani, N., Hancock, P., Pattinson, D.: Representations of stream processors using nested fixed points. Logical Methods Comput. Sci. 5(3) (2009), http:\/\/arxiv.org\/abs\/0905.4813","DOI":"10.2168\/LMCS-5(3:9)2009"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Guatto, A.: A generalized modality for recursion. In: Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, pp. 482\u2013491 (2018)","DOI":"10.1145\/3209108.3209148"},{"issue":"9","key":"3_CR22","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1109\/5.97300","volume":"79","author":"N Halbwachs","year":"1991","unstructured":"Halbwachs, N., Caspi, P., Raymond, P., Pilaud, D.: The synchronous data flow programming language LUSTRE. Proc. IEEE 79(9), 1305\u20131320 (1991). https:\/\/doi.org\/10.1109\/5.97300","journal-title":"Proc. IEEE"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Hansen, H.H., Kupke, C., Rutten, J.: Stream differential equations: specification formats and solution methods. Logical Methods Comput. Sci. 13(1) (2017). https:\/\/doi.org\/10.23638\/LMCS-13(1:3)2017","DOI":"10.23638\/LMCS-13(1:3)2017"},{"issue":"9","key":"3_CR24","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1109\/PROC.1987.13876","volume":"75","author":"E Lee","year":"1987","unstructured":"Lee, E., Messerschmitt, D.: Synchronous data flow. Proc. IEEE 75(9), 1235\u20131245 (1987). https:\/\/doi.org\/10.1109\/PROC.1987.13876","journal-title":"Proc. IEEE"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"M\u00f8gelberg, R.E., Veltri, N.: Bisimulation as path type for guarded recursive types. PACMPL 3(POPL), 4:1\u20134:29 (2019). https:\/\/doi.org\/10.1145\/3290317","DOI":"10.1145\/3290317"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Nakano, H.: A Modality for Recursion. In: LICS, pp. 255\u2013266. IEEE Comput. Society (2000). https:\/\/doi.org\/10.1109\/LICS.2000.855774","DOI":"10.1109\/LICS.2000.855774"},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Rot, J., Pous, D.: Companions, causality and codensity. Logical Methods Comput. Sci. 15(3) (Aug 2019). https:\/\/doi.org\/10.23638\/LMCS-15(3:14)2019","DOI":"10.23638\/LMCS-15(3:14)2019"},{"issue":"1","key":"3_CR28","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1017\/S0960129504004517","volume":"15","author":"J Rutten","year":"2005","unstructured":"Rutten, J.: A coinductive calculus of streams. Math. Struct. Comput. Sci. 15(1), 93\u2013147 (2005). https:\/\/doi.org\/10.1017\/S0960129504004517","journal-title":"Math. Struct. Comput. Sci."},{"key":"3_CR29","doi-asserted-by":"publisher","unstructured":"Sprunger, D., Katsumata, S.y.: Differentiable causal computations via delayed trace. In: 2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 1\u201312 (Jun 2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785670","DOI":"10.1109\/LICS.2019.8785670"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Xu, C., Escard\u00f3, M.: A constructive model of uniform continuity. In: Typed Lambda Calculi and Applications: 11th International Conference, TLCA 2013, Eindhoven, The Netherlands, June 26-28, 2013. Proceedings 11, pp. 236\u2013249. Springer (2013)","DOI":"10.1007\/978-3-642-38946-7_18"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22469-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:57:44Z","timestamp":1775055464000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22469-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032224682","9783032224699"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22469-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RAMICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"B\u0119dlewo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ramics-conf.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}