{"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":1764361449783,"version":"3.46.0"},"publisher-location":"Cham","reference-count":47,"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_11","type":"book-chapter","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T01:21:34Z","timestamp":1759281694000},"page":"259-280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Noninterference Through Bisimulation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-9828-5194","authenticated-orcid":false,"given":"April","family":"Tune","sequence":"first","affiliation":[]},{"given":"Wendy","family":"Yang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7953-7975","authenticated-orcid":false,"given":"G. A.","family":"Kavvos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Abadi, M., Banerjee, A., Heintze, N., Riecke, J.G.: A core calculus of dependency. In: Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL \u201999, pp. 147\u2013160. Association for Computing Machinery, San Antonio, Texas, USA (1999). https:\/\/doi.org\/10.1145\/292540.292555","DOI":"10.1145\/292540.292555"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Algehed, M., Bernardy, J.-P.: Simple noninterference from parametricity. In: Proceedings of the ACM on Programming Languages 3(ICFP), pp. 1\u201322 (2019). https:\/\/doi.org\/10.1145\/3341693","DOI":"10.1145\/3341693"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Altenkirch, T., Reus, B.: Monadic presentations of lambda terms using generalized inductive types. In: Computer Science Logic, pp. 453\u2013468. Springer, Heidelberg (1999)","DOI":"10.1007\/3-540-48168-0_32"},{"issue":"5","key":"11_CR4","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1145\/504709.504712","volume":"23","author":"AW Appel","year":"2001","unstructured":"Appel, A.W., McAllester, D.: An indexed model of recursive types for foundational proof-carrying code. ACM Trans. Program. Lang. Syst. 23(5), 657\u2013683 (2001). https:\/\/doi.org\/10.1145\/504709.504712","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/3-540-45699-6_2","volume-title":"Applied Semantics","author":"N Benton","year":"2002","unstructured":"Benton, N., Hughes, J., Moggi, E.: Monads and effects. In: Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.) Applied Semantics, pp. 42\u2013122. Springer, Heidelberg (2002)"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/inco.1999.2828","volume":"155","author":"L Birkedal","year":"1999","unstructured":"Birkedal, L., Harper, R.: Relational interpretations of recursive types in an operational setting. Inf. Comput. 155(1), 3\u201363 (1999). https:\/\/doi.org\/10.1006\/inco.1999.2828","journal-title":"Inf. Comput."},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Bowman, W.J., Ahmed, A.: Noninterference for free. In: Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming - ICFP 2015, pp. 101\u2013113. Association for Computing Machinery (2015). https:\/\/doi.org\/10.1145\/2784731.2784733","DOI":"10.1145\/2784731.2784733"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Choudhury, P., Eades, H., Weirich, S.: A dependent dependency calculus. In: I. Sergey. Programming Languages and Systems, pp. 403\u2013430. Springer, Cham (2022)","DOI":"10.1007\/978-3-030-99336-8_15"},{"issue":"6","key":"11_CR9","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.3233\/JCS-2009-0393","volume":"18","author":"MR Clarkson","year":"2010","unstructured":"Clarkson, M.R., Schneider, F.B.: Hyperproperties. J. Comput. Secur. 18(6), 1157\u20131210 (2010). https:\/\/doi.org\/10.3233\/JCS-2009-0393","journal-title":"J. Comput. Secur."},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Clouston, R.: Fitch-Style Modal Lambda Calculi. In: Springer International Publishing, Apr. 2018, pp. 258\u2013275. isbn: 978-3-319-89365-5. https:\/\/doi.org\/10.1007\/978-3-319-89366-2_14","DOI":"10.1007\/978-3-319-89366-2_14"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.entcs.2007.02.010","volume":"172","author":"K Crary","year":"2007","unstructured":"Crary, K., Harper, R.: Syntactic logical relations for polymorphic and recursive types. Electron. Notes Theoretical Comput. Sci. 172, 259\u2013299 (2007). https:\/\/doi.org\/10.1016\/j.entcs.2007.02.010","journal-title":"Electron. Notes Theoretical Comput. Sci."},{"issue":"3","key":"11_CR12","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/382780.382785","volume":"48","author":"R Davies","year":"2001","unstructured":"Davies, R., Pfenning, F.: A modal analysis of staged computation. J. ACM 48(3), 555\u2013604 (2001). https:\/\/doi.org\/10.1145\/382780.382785","journal-title":"J. ACM"},{"issue":"5","key":"11_CR13","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/360051.360056","volume":"19","author":"DE Denning","year":"1976","unstructured":"Denning, D.E.: A lattice model of secure information flow. Commun. ACM 19(5), 236\u2013243 (1976). https:\/\/doi.org\/10.1145\/360051.360056","journal-title":"Commun. ACM"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Dreyer, D., Ahmed, A., Birkedal, L.: Logical step-indexed logical relations. Logical Methods Comput. Sci. 7(2), 1\u201337 (2011). https:\/\/doi.org\/10.2168\/LMCS-7(2:16)2011","DOI":"10.2168\/LMCS-7(2:16)2011"},{"key":"11_CR15","unstructured":"Eagles: Hotel California. Label number AS 53051, Asylum Records (1976)"},{"issue":"1\u20133","key":"11_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2006.12.027","volume":"375","author":"A Filinski","year":"2007","unstructured":"Filinski, A.: On the relations between monadic semantics. Theoret. Comput. Sci. 375(1\u20133), 41\u201375 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2006.12.027","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR17","unstructured":"Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge University Press (1989)"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Goguen, J.A., Meseguer, J.: Security policies and security models. In: 1982 IEEE Symposium on Security and Privacy, pp. 11\u201311 (1982). https:\/\/doi.org\/10.1109\/SP.1982.10014","DOI":"10.1109\/SP.1982.10014"},{"issue":"3","key":"11_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3514241","volume":"23","author":"D Gratzer","year":"2022","unstructured":"Gratzer, D., Cavallo, E., Kavvos, G.A., Guatto, A., Birkedal, L.: Modalities and parametric adjoints. ACM Trans. Comput. Log. 23(3), 1\u201329 (2022). https:\/\/doi.org\/10.1145\/3514241","journal-title":"ACM Trans. Comput. Log."},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Gratzer, D., Kavvos, G.A., Nuyts, A., Birkedal, L.: Multimodal dependent type theory. In: Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science, pp. 492\u2013506. Association for Computing Machinery (2020). https:\/\/doi.org\/10.1145\/3373718.3394736","DOI":"10.1145\/3373718.3394736"},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Gratzer, D., Kavvos, G.A., Nuyts, A., Birkedal, L.: Multimodal dependent type theory. Logical Methods Comput. Sci. 17(3) (2021). https:\/\/doi.org\/10.46298\/lmcs-17(3:11)2021","DOI":"10.46298\/lmcs-17(3:11)2021"},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"Gregersen, S.O., Bay, J., Timany, A., Birkedal, L.: Mechanized logical relations for termination-insensitive noninterference. In: Proceedings of the ACM on Programming Languages 5(POPL) (2021). https:\/\/doi.org\/10.1145\/3434291","DOI":"10.1145\/3434291"},{"key":"11_CR23","unstructured":"Gunter, C.A.: Semantics of Programming Languages: Structures and Techniques. MIT Press (1992)"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Harper, R.: Practical Foundations for Programming Languages. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781316576892"},{"key":"11_CR25","doi-asserted-by":"publisher","unstructured":"Jang, J., G\u00e9lineau, S., Monnier, S., Pientka, B.: Moebius: metaprogramming using contextual types: the stage where system F can pattern match on itself. In: Proceedings of the ACM on Programming Languages 6(POPL) (2022). https:\/\/doi.org\/10.1145\/3498700","DOI":"10.1145\/3498700"},{"key":"11_CR26","doi-asserted-by":"publisher","unstructured":"Kavvos, G.A.: Dual-context calculi for modal logic. Logical Methods Comput. Sci. 16(3) (2020). https:\/\/doi.org\/10.23638\/LMCS-16(3:10)2020","DOI":"10.23638\/LMCS-16(3:10)2020"},{"key":"11_CR27","unstructured":"Kavvos, G.A.: Intensionality, Intensional Recursion, and the G\u00f6del-L\u00f6b axiom. J. Appl. Logics - IfCoLog J. Logics Appl. 8(8), 2287\u20132311 (2021)"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"G.A. Kavvos: Modalities, Cohesion, and Information Flow. Proceedings of the ACM on Programming Languages 3(POPL) (2019). https:\/\/doi.org\/10.1145\/3290333","DOI":"10.1145\/3290333"},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Kavvos, G.A.: On the semantics of intensionality. In: Esparza, J., Murawski, A.S.: Foundations of software science and computation structures. LNCS, pp. 550\u2013566. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54458-7_32","DOI":"10.1007\/978-3-662-54458-7_32"},{"key":"11_CR30","unstructured":"Kavvos, G.A.: On the Semantics of Intensionality and Intensional Recursion. DPhil thesis, University of Oxford (2017)"},{"key":"11_CR31","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.entcs.2011.09.023","volume":"276","author":"V Koutavas","year":"2011","unstructured":"Koutavas, V., Levy, P.B., Sumii, E.: From applicative to environmental bisimulation. Electron. Notes Theor. Comput. Sci. 276, 215\u2013235 (2011). https:\/\/doi.org\/10.1016\/j.entcs.2011.09.023","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"11_CR32","doi-asserted-by":"publisher","unstructured":"Licata, D.R., Orton, I., Pitts, A.M., Spitters, B.: Internal universes in models of homotopy type theory. In: Kirchner, H. (eds.) 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018). Leibniz International Proceedings in Informatics (LIPIcs), pp. 22:1\u201322:17. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2018.22","DOI":"10.4230\/LIPIcs.FSCD.2018.22"},{"key":"11_CR33","unstructured":"McBride, C.: A polynomial testing principle"},{"key":"11_CR34","unstructured":"Miyamoto, K., Igarashi, A.: A modal foundation for secure information flow. In: Proceedings of the Workshop on Foundations of Computer Security (FCS\u201904), pp. 187\u2013203 (2004)"},{"issue":"1","key":"11_CR35","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Inf. Comput. 93(1), 55\u201392 (1991). https:\/\/doi.org\/10.1016\/0890-5401(91)90052-4","journal-title":"Inf. Comput."},{"issue":"4","key":"11_CR36","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1017\/S0960129501003322","volume":"11","author":"F Pfenning","year":"2001","unstructured":"Pfenning, F., Davies, R.: A judgmental reconstruction of modal logic. Math. Struct. Comput. Sci. 11(4), 511\u2013540 (2001). https:\/\/doi.org\/10.1017\/S0960129501003322","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"11_CR37","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/inco.1996.0052","volume":"127","author":"AM Pitts","year":"1996","unstructured":"Pitts, A.M.: Relational properties of domains. Inf. Comput. 127(2), 66\u201390 (1996). https:\/\/doi.org\/10.1006\/inco.1996.0052","journal-title":"Inf. Comput."},{"issue":"1","key":"11_CR38","doi-asserted-by":"publisher","first-page":"129","DOI":"10.3233\/JCS-191382","volume":"28","author":"V Rajani","year":"2020","unstructured":"Rajani, V., Garg, D.: On the expressiveness and semantics of information flow types. J. Comput. Secur. 28(1), 129\u2013156 (2020). https:\/\/doi.org\/10.3233\/JCS-191382","journal-title":"J. Comput. Secur."},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: Introduction to Bisimulation and Coinduction. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511777110"},{"issue":"3","key":"11_CR40","doi-asserted-by":"publisher","first-page":"10","DOI":"10.2168\/LMCS-4(3:10)2008","volume":"4","author":"N Shikuma","year":"2008","unstructured":"Shikuma, N., Igarashi, A.: Proving noninterference by a fully complete translation to the simply typed lambda-calculus. Logical Methods Comput. Sci. 4(3), 10 (2008). https:\/\/doi.org\/10.2168\/LMCS-4(3:10)2008","journal-title":"Logical Methods Comput. Sci."},{"issue":"6","key":"11_CR41","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1017\/S0960129517000147","volume":"28","author":"M Shulman","year":"2018","unstructured":"Shulman, M.: Brouwer\u2019s fixed-point theorem in real-cohesive homotopy type theory. Math. Struct. Comput. Sci. 28(6), 856\u2013941 (2018). https:\/\/doi.org\/10.1017\/S0960129517000147","journal-title":"Math. Struct. Comput. Sci."},{"key":"11_CR42","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1023\/A:1010000313106","volume":"13","author":"C Strachey","year":"2000","unstructured":"Strachey, C.: Fundamental Concepts in Programming Languages. Higher-Order and Symbolic Computation 13, 11\u201349 (2000). https:\/\/doi.org\/10.1023\/A:1010000313106","journal-title":"Higher-Order and Symbolic Computation"},{"issue":"4","key":"11_CR43","doi-asserted-by":"publisher","first-page":"521","DOI":"10.3233\/JCS-2003-11403","volume":"11","author":"E Sumii","year":"2003","unstructured":"Sumii, E., Pierce, B.C.: Logical relations for encryption. J. Comput. Secur. 11(4), 521\u2013554 (2003). https:\/\/doi.org\/10.3233\/JCS-2003-11403","journal-title":"J. Comput. Secur."},{"key":"11_CR44","doi-asserted-by":"publisher","unstructured":"Tse, S., Zdancewic, S.: Translating dependency into parametricity. In: Proceedings of the ninth ACM SIGPLAN International Conference on Functional Programming - ICFP \u201904. Association for Computing Machinery (2004). https:\/\/doi.org\/10.1145\/1016850.1016868","DOI":"10.1145\/1016850.1016868"},{"key":"11_CR45","unstructured":"MISC"},{"key":"11_CR46","doi-asserted-by":"publisher","unstructured":"Valliappan, N., Ruch, F., Tom\u00e9 Corti\u00f1as, C.: Normalization for fitch-style modal calculi. In: Proceedings of the ACM on Programming Languages 6(ICFP) (2022). https:\/\/doi.org\/10.1145\/3547649","DOI":"10.1145\/3547649"},{"key":"11_CR47","doi-asserted-by":"publisher","unstructured":"Wadler, P.: The essence of functional programming. In: Proceedings of the 19th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL \u201992. Association for Computing Machinery (1992). https:\/\/doi.org\/10.1145\/143165.143169","DOI":"10.1145\/143165.143169"}],"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_11","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_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"ISBN":["9783031997501","9783031997518"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-99751-8_11","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"}}]}}