{"id":243717,"date":"2023-04-25T06:37:12","date_gmt":"2023-04-25T06:37:12","guid":{"rendered":"https:\/\/easyconferences.eu\/fscd2023\/?page_id=243717"},"modified":"2023-04-25T11:31:50","modified_gmt":"2023-04-25T11:31:50","slug":"accepted-papers-2","status":"publish","type":"page","link":"https:\/\/easyconferences.eu\/fscd2023\/accepted-papers-2\/","title":{"rendered":"Accepted Papers"},"content":{"rendered":"<p>[et_pb_section fb_built=&#8221;1&#8243; next_background_color=&#8221;#ffffff&#8221; _builder_version=&#8221;4.16&#8243; background_color=&#8221;#8c8c8c&#8221; top_divider_color=&#8221;#b53319&#8243; bottom_divider_style=&#8221;arrow3&#8243; global_colors_info=&#8221;{}&#8221;][et_pb_row _builder_version=&#8221;4.16&#8243; custom_margin=&#8221;-26px|auto||auto||&#8221; global_colors_info=&#8221;{}&#8221;][et_pb_column type=&#8221;4_4&#8243; _builder_version=&#8221;4.16&#8243; global_colors_info=&#8221;{}&#8221;][et_pb_text _builder_version=&#8221;4.20.2&#8243; global_colors_info=&#8221;{}&#8221;]<\/p>\n<h2 style=\"text-align: center;\"><span style=\"color: #ffffff;\">Accepted Papers<\/span><\/h2>\n<p>[\/et_pb_text][\/et_pb_column][\/et_pb_row][\/et_pb_section][et_pb_section fb_built=&#8221;1&#8243; _builder_version=&#8221;4.16&#8243; global_colors_info=&#8221;{}&#8221;][et_pb_row _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221;][et_pb_column type=&#8221;4_4&#8243; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221;][et_pb_text _builder_version=&#8221;4.20.2&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221;]<\/p>\n<ul>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Homotopy type theory as internal languages of diagrams of $\\infty$-logoses<\/strong> &#8211;\u00a0<\/span><a href=\"https:\/\/uemurax.github.io\/\">Taichi Uemura<\/a>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>The Formal Theory of Monads, Univalently<\/strong> &#8211; <\/span>Niels van der Weide.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Automata-based verification of relational properties of functions over data structures<\/strong> &#8211; <\/span><span>Th\u00e9o Losekoot,\u00a0<a href=\"http:\/\/people.irisa.fr\/Thomas.Genet\/\">Thomas Genet<\/a>\u00a0and\u00a0<a href=\"http:\/\/people.irisa.fr\/Thomas.Jensen\/\">Thomas Jensen<\/a><\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>The Sum-Product Algorithm for Quantitative Multiplicative Linear Logic<\/strong> &#8211;\u00a0<\/span><span><a href=\"https:\/\/www.irif.fr\/~michele\/\">Michele Pagani<\/a>,\u00a0<a href=\"http:\/\/www.irif.fr\/~ehrhard\/\">Thomas Ehrhard<\/a>\u00a0and Claudia Faggian<\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Generalized Newman&#8217;s Lemma for Discrete and Continuous Systems<\/strong> &#8211; <\/span>Ievgen Ivanov.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>E-unification for Second-Order Abstract Syntax<\/strong> &#8211;\u00a0<\/span><a href=\"http:\/\/github.com\/fizruk\/\">Nikolai Kudasov<\/a>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Two Decreasing Measures for Simply Typed Lambda-Terms<\/strong> &#8211;\u00a0<\/span><span><a href=\"https:\/\/foones.github.io\">Pablo Barenbaum<\/a>\u00a0and\u00a0<a href=\"https:\/\/cristiansottile.ar\">Cristian Sottile<\/a><\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Hydra Battles and AC Termination<\/strong> &#8211;\u00a0<\/span><span><a href=\"https:\/\/www.jaist.ac.jp\/~hirokawa\/\">Nao Hirokawa<\/a>\u00a0and\u00a0<a href=\"http:\/\/cl-informatik.uibk.ac.at\/~ami\/\">Aart Middeldorp<\/a><\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Strategies as Resource Terms, and their Categorical Semantics<\/strong> &#8211;\u00a0<\/span><span><a href=\"https:\/\/pageperso.lis-lab.fr\/lison.blondeau-patissier\/\">Lison Blondeau-Patissier<\/a>,\u00a0<a href=\"http:\/\/perso.ens-lyon.fr\/pierre.clairambault\/\">Pierre Clairambault<\/a>\u00a0and\u00a0<a href=\"https:\/\/www.i2m.univ-amu.fr\/perso\/lionel.vaux\/\">Lionel Vaux Auclair<\/a><\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Rewriting modulo traced comonoid structure<\/strong> &#8211;\u00a0<\/span><span><a href=\"http:\/\/www.cs.bham.ac.uk\/~drg\">Dan Ghica<\/a>\u00a0and\u00a0<a href=\"https:\/\/georgejkaye.com\">George Kaye<\/a><\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Cost-Size Semantics for Call-by-Value Higher-Order Rewriting<\/strong> &#8211;\u00a0<\/span><span><a href=\"https:\/\/www.cs.ru.nl\/~deividvale\/\">Deivid Vale<\/a>\u00a0and\u00a0<a href=\"https:\/\/www.cs.ru.nl\/~cynthiakop\/\">Cynthia Kop<\/a><\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Categorical coherence from term rewriting systems<\/strong> &#8211;\u00a0<\/span><a href=\"http:\/\/www.lix.polytechnique.fr\/Labo\/Samuel.Mimram\/\">Samuel Mimram<\/a>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Convolution Products on Double Categorie and Categorification of Rule Algebras<\/strong> &#8211;\u00a0<\/span><span><a href=\"http:\/\/nicolasbehr.com\">Nicolas Behr<\/a>,\u00a0<a href=\"http:\/\/www.irif.fr\/~mellies\/\">Paul-Andr\u00e9 Melli\u00e8s<\/a>\u00a0and\u00a0<a href=\"http:\/\/noamz.org\/\">Noam Zeilberger<\/a><\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>For the Metatheory of Type Theory, Internal Sconing Is Enough<\/strong> &#8211; <\/span><span>Rafa\u00ebl Bocquet,\u00a0<a href=\"http:\/\/akaposi.github.io\">Ambrus Kaposi<\/a>\u00a0and Christian Sattler<\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>The logical essence of compiling with continuations<\/strong> &#8211;\u00a0<\/span><span><a href=\"http:\/\/w3.math.uminho.pt\/~jes\">Jos\u00e9 Esp\u00edrito Santo<\/a>\u00a0and Filipa Mendes<\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span><span class=\"title\"><strong>On the Lattice of Program Metrics<\/strong> &#8211; <\/span><a href=\"http:\/\/www.cs.unibo.it\/~dallago\">Ugo Dal Lago<\/a>, Naohiko Hoshino and Paolo Pistone<\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Unifying Graded Linear Logic and Differential Operators<\/strong> &#8211;\u00a0<\/span><span><a href=\"https:\/\/lipn.univ-paris13.fr\/~breuvart\/\">Flavien Breuvart<\/a>,\u00a0<a href=\"https:\/\/lipn.univ-paris13.fr\/~kerjean\/\">Marie Kerjean<\/a>\u00a0and\u00a0<a href=\"https:\/\/lipn.univ-paris13.fr\/~mirwasser\/\">Simon Mirwasser<\/a><\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>\u03b1-avoidance<\/strong> &#8211; <\/span><span>Samuel Frontull, Georg Moser and Vincent van Oostrom<\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Partial model checking and partial model synthesis in LTL using a tableau-based approach<\/strong> &#8211;\u00a0<\/span><span><a href=\"http:\/\/www.ibisc.univ-evry.fr\/~serena\/\">Serenella Cerrito<\/a>,\u00a0<a href=\"http:\/\/www2.philosophy.su.se\/goranko\/\">Valentin Goranko<\/a>\u00a0and Sophie Paillocher<\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Combinatory logic and lambda calculus are equal, algebraically<\/strong> &#8211;\u00a0<\/span><span><a href=\"http:\/\/www.cs.nott.ac.uk\/~txa\/\">Thorsten Altenkirch<\/a>,\u00a0<a href=\"http:\/\/akaposi.github.io\">Ambrus Kaposi<\/a>, Artjoms Sinkarovs and Tam\u00e1s V\u00e9gh<\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Quotients and Extensionality in Relational Doctrines<\/strong> &#8211; <\/span><span>Francesco Dagnino and Fabio Pasquali<\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Type Isomorphisms for Multiplicative Additive Linear Logic<\/strong> &#8211; <\/span><span>R\u00e9mi Di Guardia and\u00a0<a href=\"http:\/\/perso.ens-lyon.fr\/olivier.laurent\/\">Olivier Laurent<\/a><\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Cyclic proofs for (arithmetical) inductive definitions<\/strong> &#8211;\u00a0<\/span><span><a href=\"http:\/\/www.anupamdas.com\">Anupam Das<\/a>\u00a0and Lukas Melgaard<\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Concurrent Realizability on Conjunctive Structures<\/strong> &#8211; <\/span><span>Emmanuel Beffara, F\u00e9lix Castro, Mauricio Guillermo and\u00a0<a href=\"https:\/\/www.i2m.univ-amu.fr\/perso\/etienne.miquey\/\">\u00c9tienne Miquey<\/a><\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>A quantitative version of simple types<\/strong> &#8211; <\/span><span>Simona Ronchi Della Rocca and Daniele Pautasso<\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Knowledge Problems in Security Protocols: Going Beyond Subterm-Convergent<\/strong> &#8211; <\/span><span>Saraid Dwyer Satterfield, Serdar Erbatur,\u00a0<a href=\"https:\/\/www.marshallandrew.net\/\">Andrew M. Marshall<\/a>\u00a0and\u00a0<a href=\"http:\/\/www.loria.fr\/~ringeiss\/\">Christophe Ringeissen<\/a><\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Labelled Tableaux for Linear Time Bunched Implication Logic<\/strong> &#8211;\u00a0<\/span><span><a href=\"http:\/\/www.loria.fr\/~galmiche\">Didier Galmiche<\/a>\u00a0and\u00a0<a href=\"https:\/\/members.loria.fr\/DMery\">Daniel Mery<\/a><\/span>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Diller-Nahm bar recursion<\/strong> &#8211;\u00a0<\/span><a href=\"https:\/\/valentinblot.org\/pro\">Valentin Blot<\/a>.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Dinaturality meets genericity: a game semantics of bounded polymorphism.<\/strong> &#8211; <\/span>James Laird.<span>\u00a0<\/span><\/span><\/li>\n<li class=\"paper\"><span class=\"authors\"><span style=\"background-color: #ffffff; font-size: 14px;\"><strong>Representing Guardedness in Call-by-Value<\/strong> &#8211;\u00a0<\/span><a href=\"http:\/\/www8.informatik.uni-erlangen.de\/~sergey\">Sergey Goncharov<\/a>.<span>\u00a0<\/span><\/span><\/li>\n<\/ul>\n<p>[\/et_pb_text][\/et_pb_column][\/et_pb_row][\/et_pb_section]<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Accepted Papers Homotopy type theory as internal languages of diagrams of $\\infty$-logoses &#8211;\u00a0Taichi Uemura.\u00a0 The Formal Theory of Monads, Univalently &#8211; Niels van der Weide.\u00a0 Automata-based verification of relational properties of functions over data structures &#8211; Th\u00e9o Losekoot,\u00a0Thomas Genet\u00a0and\u00a0Thomas Jensen.\u00a0 The Sum-Product Algorithm for Quantitative Multiplicative Linear Logic &#8211;\u00a0Michele Pagani,\u00a0Thomas Ehrhard\u00a0and Claudia Faggian.\u00a0 Generalized Newman&#8217;s [&hellip;]<\/p>\n","protected":false},"author":3,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_et_pb_use_builder":"on","_et_pb_old_content":"<!-- wp:divi\/placeholder \/-->","_et_gb_content_width":""},"_links":{"self":[{"href":"https:\/\/easyconferences.eu\/fscd2023\/wp-json\/wp\/v2\/pages\/243717"}],"collection":[{"href":"https:\/\/easyconferences.eu\/fscd2023\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/easyconferences.eu\/fscd2023\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/fscd2023\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/fscd2023\/wp-json\/wp\/v2\/comments?post=243717"}],"version-history":[{"count":4,"href":"https:\/\/easyconferences.eu\/fscd2023\/wp-json\/wp\/v2\/pages\/243717\/revisions"}],"predecessor-version":[{"id":243724,"href":"https:\/\/easyconferences.eu\/fscd2023\/wp-json\/wp\/v2\/pages\/243717\/revisions\/243724"}],"wp:attachment":[{"href":"https:\/\/easyconferences.eu\/fscd2023\/wp-json\/wp\/v2\/media?parent=243717"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}