{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T16:02:44Z","timestamp":1765123364118,"version":"3.46.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031995354"},{"type":"electronic","value":"9783031995361"}],"license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"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-99536-1_11","type":"book-chapter","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T10:54:13Z","timestamp":1753959253000},"page":"175-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Infinitary Refinement Types for\u00a0Temporal Properties in\u00a0Scott Domains"],"prefix":"10.1007","author":[{"given":"Colin","family":"Riba","sequence":"first","affiliation":[]},{"given":"Alexandre","family":"Kejikian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,1]]},"reference":[{"issue":"1\u20132","key":"11_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","volume":"51","author":"S Abramsky","year":"1991","unstructured":"Abramsky, S.: Domain theory in logical form. Ann. Pure Appl. Log. 51(1\u20132), 1\u201377 (1991). https:\/\/doi.org\/10.1016\/0168-0072(91)90065-T","journal-title":"Ann. Pure Appl. Log."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jung, A.: Domain theory. In: Abramsky, S., Gabbay, D., T.S.E., M. (eds.) Handbook of Logic in Computer Science, chap.\u00a01. Clarendon Press, Oxford (1995)","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Amadio, R.M., Curien, P.L.: Domains and Lambda-Calculi. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press (1998)","DOI":"10.1017\/CBO9780511983504"},{"key":"11_CR4","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. The MIT Press (2008)"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Berger, U., Matthes, R., Setzer, A.: Martin Hofmann\u2019s case for non-strictly positive data types. In: Dybjer, P., Esp\u00edrito\u00a0Santo, J., Pinto, L. (eds.) Proceedings of TYPES 2018, Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0130, pp. 1:1\u20131:22. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.TYPES.2018.1","DOI":"10.4230\/LIPIcs.TYPES.2018.1"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0890-5401(03)00143-3","volume":"186","author":"MM Bonsangue","year":"2003","unstructured":"Bonsangue, M.M., Kok, J.N.: Infinite intersection types. Inf. Comput. 186(2), 285\u2013318 (2003). https:\/\/doi.org\/10.1016\/S0890-5401(03)00143-3","journal-title":"Inf. Comput."},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Bradfield, J., Stirling, C.: Modal mu-calculi. In: Blackburn, P., Van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logic. Studies in Logic and Practical Reasoning, vol.\u00a03, pp. 721\u2013756. Elsevier (2007). https:\/\/doi.org\/10.1016\/S1570-2464(07)80015-2","DOI":"10.1016\/S1570-2464(07)80015-2"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Bradfield, J.C., Walukiewicz, I.: The mu-calculus and model checking. In: Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.) Handbook of Model Checking, pp. 871\u2013919. Springer, Cham (2018)","DOI":"10.1007\/978-3-319-10575-8_26"},{"key":"11_CR9","unstructured":"Bunge, M., Funk, J.: Singular Coverings of Toposes. Lecture Notes in Mathematics, vol. 1890. Springer, Heidelberg (2006)"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Dickmann, M., Schwartz, N., Tressl, M.: Spectral Spaces. New Mathematical Monographs. Cambridge University Press, Cambridge (2019). https:\/\/doi.org\/10.1017\/9781316543870","DOI":"10.1017\/9781316543870"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Gehrke, M., van Gool, S.: Topological Duality for Distributive Lattices: Theory and Applications. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2024)","DOI":"10.1017\/9781009349680"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Goubault-Larrecq, J.: Non-Hausdorff Topology and Domain Theory: Selected Topics in Point-Set Topology. New Mathematical Monographs, Cambridge University Press, Cambridge (2013). https:\/\/doi.org\/10.1017\/CBO9781139524438","DOI":"10.1017\/CBO9781139524438"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games: A Guide to Current Research. LNCS, vol. 2500. Springer, Cham (2002)","DOI":"10.1007\/3-540-36387-4"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Hodkinson, I., Reynolds, M.: Temporal logic. In: Blackburn, P., Van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logic, Studies in Logic and Practical Reasoning, vol.\u00a03, pp. 655\u2013720. Elsevier (2007). https:\/\/doi.org\/10.1016\/S1570-2464(07)80014-0","DOI":"10.1016\/S1570-2464(07)80014-0"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Hofmann, M., Chen, W.: Abstract interpretation from B\u00fcchi automata. In: Henzinger, T.A., Miller, D. (eds.) Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS 2014, Vienna, Austria, 14\u201318 July 2014, pp. 51:1\u201351:10. ACM (2014). https:\/\/doi.org\/10.1145\/2603088.2603127","DOI":"10.1145\/2603088.2603127"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Hofmann, M., Ledent, J.: A cartesian-closed category for higher-order model checking. In: 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, 20\u201323 June 2017, pp. 1\u201312. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/LICS.2017.8005120","DOI":"10.1109\/LICS.2017.8005120"},{"issue":"6","key":"11_CR17","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1017\/S0960129500003200","volume":"10","author":"M Huth","year":"2000","unstructured":"Huth, M., Jung, A., Keimel, K.: Linear types and approximation. Math. Struct. Comput. Sci. 10(6), 719\u2013745 (2000)","journal-title":"Math. Struct. Comput. Sci."},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Jaber, G., Riba, C.: Temporal refinements for guarded recursive types. In: Yoshida, N. (ed.) Proceedins of ESOP 2021. Lecture Notes in Computer Science, vol. 12648, pp. 548\u2013578. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72019-3_20","DOI":"10.1007\/978-3-030-72019-3_20"},{"key":"11_CR19","unstructured":"Johnstone, P.: Stone Spaces. Cambridge Studies in Advanced Mathematics. Cambridge University Press (1982)"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Kobayashi, N., Tabuchi, N., Unno, H.: Higher-order multi-parameter tree transducers and recursion schemes for program verification. In: POPL 2010: Proceedings of the 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 495\u2013508. Association for Computing Machinery, New York (2010). https:\/\/doi.org\/10.1145\/1707801.1706355","DOI":"10.1145\/1707801.1706355"},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Koskinen, E., Terauchi, T.: Local temporal reasoning. In: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS). CSL-LICS 2014. Association for Computing Machinery, New York (2014). https:\/\/doi.org\/10.1145\/2603088.2603138","DOI":"10.1145\/2603088.2603138"},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"Levy, P.B.: Call-By-Push-Value. Semantics Structures in Computation. Springer, Dordrecht (2003). https:\/\/doi.org\/10.1007\/978-94-007-0954-6","DOI":"10.1007\/978-94-007-0954-6"},{"issue":"2","key":"11_CR23","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/3537668.3537670","volume":"9","author":"PB Levy","year":"2022","unstructured":"Levy, P.B.: Call-by-push-value. ACM SIGLOG News 9(2), 7\u201329 (2022). https:\/\/doi.org\/10.1145\/3537668.3537670","journal-title":"ACM SIGLOG News"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Nanjo, Y., Unno, H., Koskinen, E., Terauchi, T.: A fixpoint logic and dependent effects for temporal property verification. In: Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2018, pp. 759\u2013768. Association for Computing Machinery, New York (2018). https:\/\/doi.org\/10.1145\/3209108.3209204","DOI":"10.1145\/3209108.3209204"},{"key":"11_CR25","doi-asserted-by":"publisher","unstructured":"Nygaard, M., Winskel, G.: Full abstraction for HOPLA. In: Amadio, R., Lugiez, D. (eds.) Proceedings of CONCUR 2003. Lecture Notes in Computer Science, vol.\u00a02761, pp. 378\u2013392. Springer, Cham (2003). https:\/\/doi.org\/10.1007\/978-3-540-45187-7_25","DOI":"10.1007\/978-3-540-45187-7_25"},{"key":"11_CR26","unstructured":"Pierce, B.C.: Types and Programming Languages, 1st edn. The MIT Press (2002)"},{"key":"11_CR27","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G Plotkin","year":"1977","unstructured":"Plotkin, G.: LCF considered as a programming language. Theor. Comput. Sci. 5, 223\u2013256 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Riba, C., Kejikian, A.: Infinitary Refinement Types for Temporal Properties in Scott Domains (2025). Full version, available on arXiv https:\/\/arxiv.org\/abs\/2502.11917","DOI":"10.1007\/978-3-031-99536-1_11"},{"key":"11_CR29","unstructured":"Riba, C., Stern, S.: Liveness properties in geometric logic for domain-theoretic streams. In: Proceedings of JFLA 2024 (2024). https:\/\/inria.hal.science\/hal-04407194, full version available on arXiv https:\/\/arxiv.org\/abs\/2310.12763"},{"issue":"1","key":"11_CR30","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.apal.2010.07.003","volume":"162","author":"L Santocanale","year":"2010","unstructured":"Santocanale, L., Venema, Y.: Completeness for flat modal fixpoint logics. Ann. Pure Appl. Logic 162(1), 55\u201382 (2010)","journal-title":"Ann. Pure Appl. Logic"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Sekiyama, T., Unno, H.: Temporal verification with answer-effect modification: dependent temporal type-and-effect system with delimited continuations. Proc. ACM Program. Lang. 7(POPL) (2023). Full version available on arXiv at https:\/\/arxiv.org\/abs\/2207.10386","DOI":"10.1145\/3571264"},{"issue":"2","key":"11_CR32","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1017\/S0956796807006466","volume":"18","author":"C Skalka","year":"2008","unstructured":"Skalka, C., Smith, S., Van Horn, D.: Types and trace effects of higher order programs. J. Funct. Program. 18(2), 179\u2013249 (2008). https:\/\/doi.org\/10.1017\/S0956796807006466","journal-title":"J. Funct. Program."},{"key":"11_CR33","doi-asserted-by":"publisher","unstructured":"Streicher, T.: Domain-theoretic foundations of functional programming. World Scientific (2006). https:\/\/doi.org\/10.1142\/6284. https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/6284","DOI":"10.1142\/6284"},{"key":"11_CR34","doi-asserted-by":"publisher","unstructured":"Unno, H., Satake, Y., Terauchi, T.: Relatively complete refinement type system for verification of higher-order non-deterministic programs. Proc. ACM Program. Lang. 2(POPL), 12:1\u201312:29 (2018). https:\/\/doi.org\/10.1145\/3158100","DOI":"10.1145\/3158100"},{"key":"11_CR35","volume-title":"Topology via Logic","author":"S Vickers","year":"1989","unstructured":"Vickers, S.: Topology via Logic. Cambridge University Press, Cambridge (1989)"},{"key":"11_CR36","doi-asserted-by":"publisher","unstructured":"V\u00f6lzer, H., Varacca, D., Kindler, E.: Defining fairness. In: Abadi, M., de\u00a0Alfaro, L. (eds.) Proceedings of CONCUR 2005. Lecture Notes in Computer Science, vol.\u00a03653, pp. 458\u2013472. Springer, Cham (2005). https:\/\/doi.org\/10.1007\/11539452_35","DOI":"10.1007\/11539452_35"},{"key":"11_CR37","unstructured":"Winskel, G.: Linearity and nonlinearity in distributed computation. In: Ehrhard, T., Girard, J.Y., Ruet, P. (eds.) Linear Logic in Computer Science. London Mathematical Society Lecture Note Series. Cambridge University Press (2004)"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-99536-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T14:07:08Z","timestamp":1765116428000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-99536-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,1]]},"ISBN":["9783031995354","9783031995361"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-99536-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,1]]},"assertion":[{"value":"1 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WoLLIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Language, Information, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wollic.org\/wollic2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}