{"id":949,"date":"2021-10-28T17:09:20","date_gmt":"2021-10-28T15:09:20","guid":{"rendered":"http:\/\/www.ens-lyon.fr\/LIP\/PLUME\/?page_id=949"},"modified":"2025-02-13T10:50:58","modified_gmt":"2025-02-13T09:50:58","slug":"production","status":"publish","type":"page","link":"https:\/\/www.ens-lyon.fr\/LIP\/PLUME\/production\/","title":{"rendered":"Publications"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\"><\/h2>\n\n\n\n<p class=\"wp-block-paragraph\"><div id=\"wphal-content\"><ul id=\"wphal-menu\"><li><a href=\"#publications\" onclick=\"displayElem(&apos;publications&apos;); return false;\" style=\"font-size:18px;text-decoration: none\">Publications<\/a><\/li><li><a href=\"#filtres\" onclick=\"return false;\" style=\"font-size:18px;text-decoration: none;cursor:default\">Metadata<\/a><ul id=\"wphal-filtres\"><li><a href=\"#annees\" onclick=\"displayElem(&apos;wphal-annees&apos;); return false;\" style=\"margin:1px;text-decoration: none\">Year of production<\/a><\/li><\/ul><\/li><\/ul><br \/><hr><div id=\"meta\">\n        <div class=\"display\" id=\"wphal-contact\" style=\"display: none\">\n            <h3 class=\"wphal-titre\">Contact<\/h3>\n\n            <ul id=\"wphal-cont\" style=\"list-style-type: none\"><\/ul>\n        <\/div>\n        <div class=\"display\" id=\"wphal-disciplines\" style=\"display: none\">\n            <h3 class=\"wphal-titre\">Domains<\/h3><\/div>\n        <div class=\"display\" id=\"wphal-keywords\" style=\"display: none\">\n            <h3 class=\"wphal-titre\">Keywords<\/h3><\/div>\n        <div class=\"display\" id=\"wphal-auteurs\" style=\"display: none\">\n            <h3 class=\"wphal-titre\">Authors<\/h3><\/div>\n        <div class=\"display\" id=\"wphal-affiliated\" style=\"display: none\">\n            <h3 class=\"wphal-titre\">Affiliated authors<\/h3><\/div>\n        <div class=\"display\" id=\"wphal-revues\" style=\"display: none\">\n            <h3 class=\"wphal-titre\">Journals<\/h3><\/div>\n        <div class=\"display\" id=\"wphal-annees\" style=\"display: none\">\n            <h3 class=\"wphal-titre\">Year of production<\/h3><span id=\"triannees\"><button type=\"button\" class=\"trial\" id=\"trian\" onclick=\"toggleSort(this, true, &apos;wphal-an&apos;, &apos;anneesuite&apos;, &apos;trian&apos;); return false;\" style=\"font-size:16px;text-decoration: none\">Tri Alphab\u00e9tique<\/button><button type=\"button\" class=\"trioc\" id=\"trinban\" onclick=\"toggleSort(this, false, &apos;wphal-an&apos;, &apos;anneesuite&apos;, &apos;trinban&apos;); return false;\" style=\"font-size:16px;text-decoration: none\">Tri Occurrence<\/button><\/span><ul class=\"wphal-annees\"><div id=\"wphal-an\"><li class=\"metadata\" data-percentage=\"11\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2026+AND+structId_i:(458310)\" target=\"_blank\">2026<\/a><span class=\"wphal-nbmetadata\">11<\/span><\/li><li class=\"metadata\" data-percentage=\"25\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2025+AND+structId_i:(458310)\" target=\"_blank\">2025<\/a><span class=\"wphal-nbmetadata\">25<\/span><\/li><li class=\"metadata\" data-percentage=\"19\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2024+AND+structId_i:(458310)\" target=\"_blank\">2024<\/a><span class=\"wphal-nbmetadata\">19<\/span><\/li><li class=\"metadata\" data-percentage=\"11\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2023+AND+structId_i:(458310)\" target=\"_blank\">2023<\/a><span class=\"wphal-nbmetadata\">11<\/span><\/li><li class=\"metadata\" data-percentage=\"20\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2022+AND+structId_i:(458310)\" target=\"_blank\">2022<\/a><span class=\"wphal-nbmetadata\">20<\/span><\/li><li class=\"metadata\" data-percentage=\"31\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2021+AND+structId_i:(458310)\" target=\"_blank\">2021<\/a><span class=\"wphal-nbmetadata\">31<\/span><\/li><li class=\"metadata\" data-percentage=\"26\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2020+AND+structId_i:(458310)\" target=\"_blank\">2020<\/a><span class=\"wphal-nbmetadata\">26<\/span><\/li><li class=\"metadata\" data-percentage=\"42\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2019+AND+structId_i:(458310)\" target=\"_blank\">2019<\/a><span class=\"wphal-nbmetadata\">42<\/span><\/li><li class=\"metadata\" data-percentage=\"28\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2018+AND+structId_i:(458310)\" target=\"_blank\">2018<\/a><span class=\"wphal-nbmetadata\">28<\/span><\/li><li class=\"metadata\" data-percentage=\"26\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2017+AND+structId_i:(458310)\" target=\"_blank\">2017<\/a><span class=\"wphal-nbmetadata\">26<\/span><\/li><div id=\"anneesuite\" style=\"display:none\"><li class=\"metadata\" data-percentage=\"14\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2016+AND+structId_i:(458310)\" target=\"_blank\">2016<\/a><span class=\"wphal-nbmetadata\">14<\/span><\/li><li class=\"metadata\" data-percentage=\"23\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2015+AND+structId_i:(458310)\" target=\"_blank\">2015<\/a><span class=\"wphal-nbmetadata\">23<\/span><\/li><li class=\"metadata\" data-percentage=\"14\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2014+AND+structId_i:(458310)\" target=\"_blank\">2014<\/a><span class=\"wphal-nbmetadata\">14<\/span><\/li><li class=\"metadata\" data-percentage=\"15\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2013+AND+structId_i:(458310)\" target=\"_blank\">2013<\/a><span class=\"wphal-nbmetadata\">15<\/span><\/li><li class=\"metadata\" data-percentage=\"10\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2012+AND+structId_i:(458310)\" target=\"_blank\">2012<\/a><span class=\"wphal-nbmetadata\">10<\/span><\/li><li class=\"metadata\" data-percentage=\"4\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2011+AND+structId_i:(458310)\" target=\"_blank\">2011<\/a><span class=\"wphal-nbmetadata\">4<\/span><\/li><li class=\"metadata\" data-percentage=\"5\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2010+AND+structId_i:(458310)\" target=\"_blank\">2010<\/a><span class=\"wphal-nbmetadata\">5<\/span><\/li><li class=\"metadata\" data-percentage=\"1\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2009+AND+structId_i:(458310)\" target=\"_blank\">2009<\/a><span class=\"wphal-nbmetadata\">1<\/span><\/li><li class=\"metadata\" data-percentage=\"4\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2008+AND+structId_i:(458310)\" target=\"_blank\">2008<\/a><span class=\"wphal-nbmetadata\">4<\/span><\/li><li class=\"metadata\" data-percentage=\"4\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2007+AND+structId_i:(458310)\" target=\"_blank\">2007<\/a><span class=\"wphal-nbmetadata\">4<\/span><\/li><li class=\"metadata\" data-percentage=\"2\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2006+AND+structId_i:(458310)\" target=\"_blank\">2006<\/a><span class=\"wphal-nbmetadata\">2<\/span><\/li><li class=\"metadata\" data-percentage=\"3\"><a href=\"https:\/\/hal.science\/search\/index\/?q=producedDateY_i:2005+AND+structId_i:(458310)\" target=\"_blank\">2005<\/a><span class=\"wphal-nbmetadata\">3<\/span><\/li><\/div><\/div><\/ul><button type=\"button\" style=\"text-decoration: none\" id=\"wphal-annee\" onclick=\"visibiliteannee(&apos;anneesuite&apos;); return false;\">Full list<\/button><\/div>\n        <div class=\"display\" id=\"wphal-insts\" style=\"display: none\">\n            <h3 class=\"wphal-titre\">Institutions<\/h3><\/div>\n       <div class=\"display\" id=\"wphal-labs\" style=\"display: none\">\n            <h3 class=\"wphal-titre\">Laboratories<\/h3><\/div>\n       <div class=\"display\" id=\"wphal-depts\" style=\"display: none\">\n            <h3 class=\"wphal-titre\">Departments<\/h3><\/div>\n       <div class=\"display\" id=\"wphal-equipes\" style=\"display: none\">\n            <h3 class=\"wphal-titre\">Research team<\/h3><\/div>\n    <div class=\"display\" id=\"publications\"><div class=\"counter-doc\"><span class=\"wphal-nbtot\">338 <\/span>documents<\/div><br><div class=\"grp-div\"><h3 class=\"wphal-titre-groupe\">Journal articles<span class=\"wphal-nbmetadata\" style=\"margin-left:10px\">80 document<\/span><\/h3><div class=\"grp-content\"><ul><li>Olivier Laurent. YALLA: Yet Another deep embedding of Linear Logic in Rocq. <i>Journal of Automated Reasoning<\/i>, 2026, 70 (1), pp.9. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s10817-026-09755-y\">&#x27E8;10.1007\/s10817-026-09755-y&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05741458v1\">&#x27E8;hal-05741458&#x27E9;<\/a><\/li><li>R\u00e9mi Di Guardia, Olivier Laurent. Type Isomorphisms for Multiplicative-Additive Linear Logic. <i>Logical Methods in Computer Science<\/i>, 2025, 21 (4), <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.46298\/lmcs-21(4:24)2025\">&#x27E8;10.46298\/lmcs-21(4:24)2025&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04460547v3\">&#x27E8;hal-04460547v3&#x27E9;<\/a><\/li><li>Cyril Cohen, Kazuhiko Sakaguchi. A bargain for mergesorts \u2014 How to prove your mergesort correct and stable, almost for free. <i>Proceedings of the ACM on Programming Languages<\/i>, 2025, 9 (ICFP), pp.1-29. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3747505\">&#x27E8;10.1145\/3747505&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05111866v2\">&#x27E8;hal-05111866v2&#x27E9;<\/a><\/li><li>Cameron Calk, Philippe Malbos, Damien Pous, Georg Struth. Higher Catoids, Higher Quantales and their Correspondences. <i>Applied Categorical Structures<\/i>, 2025, 33 (4), pp.25. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s10485-025-09817-z\">&#x27E8;10.1007\/s10485-025-09817-z&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05409389v1\">&#x27E8;hal-05409389&#x27E9;<\/a><\/li><li>Thomas Kosc, Denis Kuperberg, Etienne Rajon, Sylvain Charlat. Thermodynamic consistency of autocatalytic cycles. <i>Proceedings of the National Academy of Sciences of the United States of America<\/i>, 2025, 122 (18), pp.e2421274122. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1101\/2024.10.11.617739\">&#x27E8;10.1101\/2024.10.11.617739&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/univ-lyon1.hal.science\/hal-04740407v2\">&#x27E8;hal-04740407v2&#x27E9;<\/a><\/li><li>Damien Pous, Jana Wagemaker. Completeness Theorems for Kleene algebra with tests and top. <i>Logical Methods in Computer Science<\/i>, 2024, Volume 20, Issue 3, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.46298\/lmcs-20(3:27)2024\">&#x27E8;10.46298\/lmcs-20(3:27)2024&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04792491v1\">&#x27E8;hal-04792491&#x27E9;<\/a><\/li><li>L\u00ea Th\u00e0nh D\u0169ng Nguy\u1ec5n. Simply typed convertibility is TOWER-complete even for safe lambda-terms. <i>Logical Methods in Computer Science<\/i>, 2024, 20 (3), pp.21:1-21:15. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.46298\/LMCS-20(3:21)2024\">&#x27E8;10.46298\/LMCS-20(3:21)2024&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04688374v1\">&#x27E8;hal-04688374&#x27E9;<\/a><\/li><li>Ma\u0142gorzata Biernacka, Dariusz Biernacki, Sergue\u00ef Lenglet, Piotr Polesiuk, Damien Pous, et al.. Fully Abstract Encodings of Lambda-Calculus in HOcore through Abstract Machines. <i>Logical Methods in Computer Science<\/i>, 2024, 20 (3), pp.1-45. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.46298\/lmcs-20(3:3)2024\">&#x27E8;10.46298\/lmcs-20(3:3)2024&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-04638249v1\">&#x27E8;hal-04638249&#x27E9;<\/a><\/li><li>Damien Pous, Jurriaan Rot, Jana Wagemaker. On Tools for Completeness of Kleene Algebra with Hypotheses (extended version). <i>Logical Methods in Computer Science<\/i>, 2024, Volume 20, Issue 2, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.46298\/lmcs-20(2:8)2024\">&#x27E8;10.46298\/lmcs-20(2:8)2024&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04792479v1\">&#x27E8;hal-04792479&#x27E9;<\/a><\/li><li>Matteo Mio, Ralph Sarkis, Valeria Vignudelli. Universal Quantitative Algebra for Fuzzy Relations and Generalised Metric Spaces. <i>Logical Methods in Computer Science<\/i>, 2024, Volume 20, Issue 4, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.46298\/lmcs-20(4:19)2024\">&#x27E8;10.46298\/lmcs-20(4:19)2024&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04236610v1\">&#x27E8;hal-04236610&#x27E9;<\/a><\/li><li>L\u00ea Th\u00e0nh D\u0169ng Nguy\u00ean, Lutz Stra\u00dfburger. A System of Interaction and Structure III: The Complexity of BV and Pomset Logic. <i>Logical Methods in Computer Science<\/i>, 2023, 9 (4), <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.46298\/LMCS-19(4:25)2023\">&#x27E8;10.46298\/LMCS-19(4:25)2023&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-03909547v2\">&#x27E8;hal-03909547v2&#x27E9;<\/a><\/li><li>Nicolas Behr, Russ Harmer, Jean Krivine. Fundamentals of Compositional Rewriting Theory. <i>Journal of Logical and Algebraic Methods in Programming<\/i>, 2023, 135, pp.100893. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.jlamp.2023.100893\">&#x27E8;10.1016\/j.jlamp.2023.100893&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03739405v1\">&#x27E8;hal-03739405&#x27E9;<\/a><\/li><li>Denis Kuperberg. Positive First-Order Logic on Words and Graphs. <i>Logical Methods in Computer Science<\/i>, 2023, 19 (3), pp.7:1 - 7:35. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.46298\/LMCS-19(3:7)2023\">&#x27E8;10.46298\/LMCS-19(3:7)2023&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03865495v2\">&#x27E8;hal-03865495v2&#x27E9;<\/a><\/li><li>Pierre Lescanne. Holonomic equations and efficient random generation of binary trees. <i>Discrete Mathematics and Theoretical Computer Science<\/i>, 2023, vol. 25:2, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.46298\/dmtcs.10952\">&#x27E8;10.46298\/dmtcs.10952&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03674690v6\">&#x27E8;hal-03674690v6&#x27E9;<\/a><\/li><li>Pierre Lescanne. Almost all Classical Theorems are Intuitionistic. <i>RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)<\/i>, 2022, 56, pp.9. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1051\/ita\/2022009\">&#x27E8;10.1051\/ita\/2022009&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04864683v1\">&#x27E8;hal-04864683&#x27E9;<\/a><\/li><li>Patrick Baillot, Alexis Ghyselen. Types for Complexity of Parallel Computation in Pi-calculus (Long Version). <i>ACM Transactions on Programming Languages and Systems (TOPLAS)<\/i>, 2022, 44 (3), pp.1-50. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3495529\">&#x27E8;10.1145\/3495529&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02961427v3\">&#x27E8;hal-02961427v3&#x27E9;<\/a><\/li><li>Filippo Bonchi, Ana Sokolova, Valeria Vignudelli. The Theory of Traces for Systems with Nondeterminism, Probability, and Termination. <i>Logical Methods in Computer Science<\/i>, 2022, Volume 18, Issue 2, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.46298\/lmcs-18(2:21)2022\">&#x27E8;10.46298\/lmcs-18(2:21)2022&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04856064v1\">&#x27E8;hal-04856064&#x27E9;<\/a><\/li><li>Christophe Lucas, Matteo Mio. Proof Theory of Riesz Spaces and Modal Riesz Spaces. <i>Logical Methods in Computer Science<\/i>, 2022, Volume 18, Issue 1, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.46298\/lmcs-18(1:32)2022\">&#x27E8;10.46298\/lmcs-18(1:32)2022&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03613512v1\">&#x27E8;hal-03613512&#x27E9;<\/a><\/li><li>Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi. Eager Functions as Processes (long version). <i>Theoretical Computer Science<\/i>, In press, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.tcs.2022.01.043\">&#x27E8;10.1016\/j.tcs.2022.01.043&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03466150v3\">&#x27E8;hal-03466150v3&#x27E9;<\/a><\/li><li>Jean-Marie Madiot, Damien Pous, Davide Sangiorgi. Modular coinduction up-to for higher-order languages via first-order transition systems. <i>Logical Methods in Computer Science<\/i>, 2021, Volume 17, Issue 3, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.46298\/lmcs-17(3:25)2021\">&#x27E8;10.46298\/lmcs-17(3:25)2021&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03350199v1\">&#x27E8;hal-03350199&#x27E9;<\/a><\/li><li>Damien Pous, Denis Kuperberg, Laureline Pinault. Coinductive Algorithms for B\u00fcchi Automata. <i>Fundamenta Informaticae<\/i>, 2021, 180 (4), pp.351-373. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.3233\/FI-2021-2046\">&#x27E8;10.3233\/FI-2021-2046&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03364935v1\">&#x27E8;hal-03364935&#x27E9;<\/a><\/li><li>Denis Kuperberg, Laureline Pinault, Damien Pous. Cyclic proofs, system T, and the power of contraction. <i>Proceedings of the ACM on Programming Languages<\/i>, 2021, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3434282\">&#x27E8;10.1145\/3434282&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02487175v2\">&#x27E8;hal-02487175v2&#x27E9;<\/a><\/li><li>Russ Harmer, Eugenia Oshurko. Reversibility and composition of rewriting in hierarchies. <i>EPTCS<\/i>, 2020. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02869865v2\">&#x27E8;hal-02869865v2&#x27E9;<\/a><\/li><li>Rapha\u00ebl Berthon, Nathana\u00ebl Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, et al.. Alternating Tree Automata with Qualitative Semantics. <i>ACM Transactions on Computational Logic<\/i>, 2020, 22 (1), <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3431860\">&#x27E8;10.1145\/3431860&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02533936v1\">&#x27E8;hal-02533936&#x27E9;<\/a><\/li><li>Russ Harmer, Eugenia Oshurko. Knowledge representation and update in hierarchies of graphs. <i>Journal of Logical and Algebraic Methods in Programming<\/i>, 2020, 114, pp.100559. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.jlamp.2020.100559\">&#x27E8;10.1016\/j.jlamp.2020.100559&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02869805v1\">&#x27E8;hal-02869805&#x27E9;<\/a><\/li><li>Patrick Baillot, Alexis Ghyselen. Combining Linear Logic and Size Types for Implicit Complexity. <i>Theoretical Computer Science<\/i>, 2020, 813, pp.70-99. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/J.TCS.2019.09.032\">&#x27E8;10.1016\/J.TCS.2019.09.032&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01687224v1\">&#x27E8;hal-01687224&#x27E9;<\/a><\/li><li>Colin Riba. Monoidal-closed categories of tree automata. <i>Mathematical Structures in Computer Science<\/i>, 2020, 30 (1), pp.62-117. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1017\/S0960129519000173\">&#x27E8;10.1017\/S0960129519000173&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04907886v1\">&#x27E8;hal-04907886&#x27E9;<\/a><\/li><li>Pierre Clairambault, Marc de Visme. Full abstraction for the quantum lambda-calculus. <i>Proceedings of the ACM on Programming Languages<\/i>, 2020, 4 (POPL), pp.1-28. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3371131\">&#x27E8;10.1145\/3371131&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02863835v1\">&#x27E8;hal-02863835&#x27E9;<\/a><\/li><li>Anupam Das, Colin Riba. A Functional (Monadic) Second-Order Theory of Infinite Trees. <i>Logical Methods in Computer Science<\/i>, 2020, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.23638\/LMCS-16(4:6)2020\">&#x27E8;10.23638\/LMCS-16(4:6)2020&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04907869v1\">&#x27E8;hal-04907869&#x27E9;<\/a><\/li><li>Christian Doczkal, Damien Pous. Graph Theory in Coq: Minors, Treewidth, and Isomorphisms. <i>Journal of Automated Reasoning<\/i>, 2020, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s10817-020-09543-2\">&#x27E8;10.1007\/s10817-020-09543-2&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02316859v2\">&#x27E8;hal-02316859v2&#x27E9;<\/a><\/li><li>Robert Furber, Radu Mardare, Matteo Mio. PROBABILISTIC LOGICS BASED ON RIESZ SPACES. <i>Logical Methods in Computer Science<\/i>, 2020, 16, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.23638\/LMCS-16(1:6)2020\">&#x27E8;10.23638\/LMCS-16(1:6)2020&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02456423v1\">&#x27E8;hal-02456423&#x27E9;<\/a><\/li><li>Olivier Laurent. Polynomial time in untyped elementary linear logic. <i>Theoretical Computer Science<\/i>, 2020, 813, pp.117-142. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.tcs.2019.10.002\">&#x27E8;10.1016\/j.tcs.2019.10.002&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02333452v1\">&#x27E8;hal-02333452&#x27E9;<\/a><\/li><li>Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi. Towards 'up to context' reasoning about higher-order processes. <i>Theoretical Computer Science<\/i>, 2020, 807, pp.154-168. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.tcs.2019.09.036\">&#x27E8;10.1016\/j.tcs.2019.09.036&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01857391v1\">&#x27E8;hal-01857391&#x27E9;<\/a><\/li><li>Damien Pous, Davide Sangiorgi. Bisimulation and Coinduction Enhancements: A Historical Perspective. <i>Formal Aspects of Computing<\/i>, 2019, 31 (6), pp.733-749. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s00165-019-00497-w\">&#x27E8;10.1007\/s00165-019-00497-w&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02393949v1\">&#x27E8;hal-02393949&#x27E9;<\/a><\/li><li>Patrick Baillot, Gilles Barthe, Ugo Dal Lago. Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs. <i>Journal of Automated Reasoning<\/i>, 2019, 63 (4), pp.813-855. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-662-48899-7_15\">&#x27E8;10.1007\/978-3-662-48899-7_15&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01197456v3\">&#x27E8;hal-01197456v3&#x27E9;<\/a><\/li><li>Davide Sangiorgi, Valeria Vignudelli. Environmental Bisimulations for Probabilistic Higher-order Languages. <i>ACM Transactions on Programming Languages and Systems (TOPLAS)<\/i>, 2019, 41 (4), pp.1-64. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3350618\">&#x27E8;10.1145\/3350618&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04856045v1\">&#x27E8;hal-04856045&#x27E9;<\/a><\/li><li>Damien Pous, Jurriaan Rot. Companions, Causality and Codensity. <i>Logical Methods in Computer Science<\/i>, 2019, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.23638\/LMCS-15(3:14)2019\">&#x27E8;10.23638\/LMCS-15(3:14)2019&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02330940v1\">&#x27E8;hal-02330940&#x27E9;<\/a><\/li><li>Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi. Divergence and unique solution of equations. <i>Logical Methods in Computer Science<\/i>, 2019, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.23638\/LMCS-15(3:12)2019\">&#x27E8;10.23638\/LMCS-15(3:12)2019&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02376814v1\">&#x27E8;hal-02376814&#x27E9;<\/a><\/li><li>Russ Harmer, Yves-Stan Le Cornec, S\u00e9bastien L\u00e9gar\u00e9, Eugenia Oshurko. Bio-curation for cellular signalling: the KAMI project. <i>IEEE\/ACM Transactions on Computational Biology and Bioinformatics<\/i>, 2019, 16 (5), pp.1562-1573. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/TCBB.2019.2906164\">&#x27E8;10.1109\/TCBB.2019.2906164&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02127147v1\">&#x27E8;hal-02127147&#x27E9;<\/a><\/li><li>Simon Castellan, Pierre Clairambault, Glynn Winskel. Thin Games with Symmetry and Concurrent Hyland-Ong Games. <i>Logical Methods in Computer Science<\/i>, 2019, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.2168\/LMCS-15(1:18)2019\">&#x27E8;10.2168\/LMCS-15(1:18)2019&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01068769v4\">&#x27E8;hal-01068769v4&#x27E9;<\/a><\/li><li>Ugo Dal Lago, Marc de Visme, Damiano Mazza, Akira Yoshimizu. Intersection Types and Runtime Errors in the Pi-Calculus. <i>Proceedings of the ACM on Programming Languages<\/i>, 2019, 3 (POPL), pp.1-29. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3290320\">&#x27E8;10.1145\/3290320&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02399565v1\">&#x27E8;hal-02399565&#x27E9;<\/a><\/li><li>Pierre Clairambault, Marc de Visme, Glynn Winskel. Game semantics for quantum programming. <i>Proceedings of the ACM on Programming Languages<\/i>, 2019, 3 (POPL), pp.1-29. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3290345\">&#x27E8;10.1145\/3290345&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02112184v1\">&#x27E8;hal-02112184&#x27E9;<\/a><\/li><li>Maciej Bendkowski, Pierre Lescanne. On the enumeration of closures and environments with an application to random generation. <i>Logical Methods in Computer Science<\/i>, 2019, 15 (4), <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.23638\/LMCS-15(4:3)2019\">&#x27E8;10.23638\/LMCS-15(4:3)2019&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04864739v1\">&#x27E8;hal-04864739&#x27E9;<\/a><\/li><li>Leszek Ko\u0142odziejczyk, Henryk Michalewski, C\u00e9cilia Pradic, Micha\u0142 Skrzypczak. The logical strength of B\\\"uchi's decidability theorem. <i>Logical Methods in Computer Science<\/i>, 2019, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.23638\/LMCS-15(2:16)2019\">&#x27E8;10.23638\/LMCS-15(2:16)2019&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04832336v1\">&#x27E8;hal-04832336&#x27E9;<\/a><\/li><li>C\u00e9cilia Pradic, Colin Riba. A Curry-Howard Approach to Church's Synthesis. <i>Logical Methods in Computer Science<\/i>, 2019, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.23638\/LMCS-15(4:13)2019\">&#x27E8;10.23638\/LMCS-15(4:13)2019&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04907860v1\">&#x27E8;hal-04907860&#x27E9;<\/a><\/li><li>Matthieu Perrinel. Paths-based criteria and application to linear logic subsystems characterizing polynomial time. <i>Information and Computation<\/i>, 2018, 261, pp.23-54. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.ic.2018.05.004\">&#x27E8;10.1016\/j.ic.2018.05.004&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02154716v1\">&#x27E8;hal-02154716&#x27E9;<\/a><\/li><li>Florent Br\u00e9hard, Nicolas Brisebarre, Mioara Joldes. Validated and numerically efficient Chebyshev spectral methods for linear ordinary differential equations. <i>ACM Transactions on Mathematical Software<\/i>, 2018, 44 (4), pp.44:1-44:42. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3208103\">&#x27E8;10.1145\/3208103&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01526272v3\">&#x27E8;hal-01526272v3&#x27E9;<\/a><\/li><li>Patrick Baillot, Erika de Benedetti, Simona Ronchi Della Rocca. Characterizing polynomial and exponential complexity classes in elementary lambda-calculus.. <i>Information and Computation<\/i>, 2018, 248, pp.55-77. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01948275v1\">&#x27E8;hal-01948275&#x27E9;<\/a><\/li><li>Matteo Mio, Micha L Skrzypczak, Henryk Michalewski. Monadic Second Order Logic with Measure and Category Quantifiers. <i>Logical Methods in Computer Science<\/i>, 2018, 14, pp.1 - 29. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.23638\/LMCS-14(2:2)2018\">&#x27E8;10.23638\/LMCS-14(2:2)2018&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01872169v1\">&#x27E8;hal-01872169&#x27E9;<\/a><\/li><li>Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz. Soundness in negotiations. <i>Logical Methods in Computer Science<\/i>, 2018, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs\">&#x27E8;10.4230\/LIPIcs&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01891179v1\">&#x27E8;hal-01891179&#x27E9;<\/a><\/li><li>Pierre Clairambault, Charles Grellois, Andrzej Murawski. Linearity in higher-order recursion schemes. <i>Proceedings of the ACM on Programming Languages<\/i>, 2017, 2, pp.1 - 29. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3158127\">&#x27E8;10.1145\/3158127&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01886931v1\">&#x27E8;hal-01886931&#x27E9;<\/a><\/li><li>Simon Castellan, Pierre Clairambault, Peter Dybjer. Undecidability of Equality in the Free Locally Cartesian Closed Category (Extended Version). <i>Logical Methods in Computer Science<\/i>, 2017, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.23638\/LMCS-13(4:22)2017\">&#x27E8;10.23638\/LMCS-13(4:22)2017&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-01579415v1\">&#x27E8;hal-01579415&#x27E9;<\/a><\/li><li>Tomasz Gogacz, Henryk Michalewski, Matteo Mio, Micha\u0142 Skrzypczak. Measure properties of regular sets of trees. <i>Information and Computation<\/i>, 2017, 256, pp.108 - 130. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.ic.2017.04.012\">&#x27E8;10.1016\/j.ic.2017.04.012&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01872157v1\">&#x27E8;hal-01872157&#x27E9;<\/a><\/li><li>Simon Castellan, Pierre Clairambault, Silvain Rideau, Glynn Winskel. Games and Strategies as Event Structures. <i>Logical Methods in Computer Science<\/i>, 2017, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.23638\/LMCS-13(3:35)2017\">&#x27E8;10.23638\/LMCS-13(3:35)2017&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01302713v3\">&#x27E8;hal-01302713v3&#x27E9;<\/a><\/li><li>Paul Brunet, Damien Pous. Petri Automata. <i>Logical Methods in Computer Science<\/i>, 2017, 13 (3), pp.1-50. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.23638\/LMCS-13(3:33)2017\">&#x27E8;10.23638\/LMCS-13(3:33)2017&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01934638v1\">&#x27E8;hal-01934638&#x27E9;<\/a><\/li><li>Olivier Laurent. Focusing in Orthologic. <i>Logical Methods in Computer Science<\/i>, 2017, 13 (3), pp.6. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.23638\/LMCS-13(3:6)2017\">&#x27E8;10.23638\/LMCS-13(3:6)2017&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01566869v1\">&#x27E8;hal-01566869&#x27E9;<\/a><\/li><li>Matteo Mio, Alex Simpson. \u0141ukasiewicz \u03bc-calculus. <i>Fundamenta Informaticae<\/i>, 2017, 150 (3-4), pp.317 - 346. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.3233\/FI-2017-1472\">&#x27E8;10.3233\/FI-2017-1472&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01903167v1\">&#x27E8;hal-01903167&#x27E9;<\/a><\/li><li>Anupam Das, Lutz Strassburger. On linear rewriting systems for Boolean logic and some applications to proof theory. <i>Logical Methods in Computer Science<\/i>, 2016. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-01422611v1\">&#x27E8;hal-01422611&#x27E9;<\/a><\/li><li>Filippo Bonchi, Daniela Petri\u015fan, Damien Pous, Jurriaan Rot. A General Account of Coinduction Up-To. <i>Acta Informatica<\/i>, 2016, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s00236-016-0271-4\">&#x27E8;10.1007\/s00236-016-0271-4&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01442724v1\">&#x27E8;hal-01442724&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi. Name-passing calculi: From fusions to preorders and types. <i>Information and Computation<\/i>, 2016, 251, pp.26. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.ic.2016.10.003\">&#x27E8;10.1016\/j.ic.2016.10.003&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-01419632v1\">&#x27E8;hal-01419632&#x27E9;<\/a><\/li><li>Patrick Baillot, Ugo Dal Lago. Higher-order interpretations and program complexity. <i>Information and Computation<\/i>, 2016, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.ic.2015.12.008\">&#x27E8;10.1016\/j.ic.2015.12.008&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-01337728v1\">&#x27E8;hal-01337728&#x27E9;<\/a><\/li><li>Jurriaan Rot, Filippo Bonchi, Marcello Bonsangue, Damien Pous, Jan Rutten, et al.. Enhanced Coalgebraic Bisimulation. <i>Mathematical Structures in Computer Science<\/i>, 2015, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1017\/S0960129515000523\">&#x27E8;10.1017\/S0960129515000523&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01288960v1\">&#x27E8;hal-01288960&#x27E9;<\/a><\/li><li>Patrick Baillot. On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy.. <i>Information and Computation<\/i>, 2015, 241, pp.3-31. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01948302v1\">&#x27E8;hal-01948302&#x27E9;<\/a><\/li><li>Vincent Danos, Russell Harmer, Ricardo Honorato-Zimmer, Hern\u00e1n Melgratti. Thermodynamic graph-rewriting. <i>Logical Methods in Computer Science<\/i>, 2015, 11 (2), <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.2168\/LMCS-11(2:13)2015\">&#x27E8;10.2168\/LMCS-11(2:13)2015&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01974698v1\">&#x27E8;hal-01974698&#x27E9;<\/a><\/li><li>Pierre Clairambault. Bounding Linear Head Reduction and Visible Interaction Through Skeletons. <i>Logical Methods in Computer Science<\/i>, 2015, 11 (2), pp.6. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.2168\/LMCS-11(2:6)2015\">&#x27E8;10.2168\/LMCS-11(2:6)2015&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01286473v1\">&#x27E8;hal-01286473&#x27E9;<\/a><\/li><li>Filippo Bonchi, Damien Pous. Hacking nondeterminism with induction and coinduction.. <i>Communications of the ACM<\/i>, 2015, 58 (2), pp.87-95. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/2713167\">&#x27E8;10.1145\/2713167&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01284907v1\">&#x27E8;hal-01284907&#x27E9;<\/a><\/li><li>Pierre Clairambault, Peter Dybjer. The Biequivalence of Locally Cartesian Closed Categories and Martin-L\u00f6f Type Theories. <i>Mathematical Structures in Computer Science<\/i>, 2014, 24 (05), pp.e240501. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1017\/S0960129513000881\">&#x27E8;10.1017\/S0960129513000881&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00990027v1\">&#x27E8;hal-00990027&#x27E9;<\/a><\/li><li>Vincent Danos, Russell Harmer, Ricardo Honorato-Zimmer. Thermodynamic graph-rewriting. <i>Logical Methods in Computer Science<\/i>, 2014, 11 (2), pp.13. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.2168\/LMCS-11(2:13)2015\">&#x27E8;10.2168\/LMCS-11(2:13)2015&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01263637v1\">&#x27E8;hal-01263637&#x27E9;<\/a><\/li><li>Pierre Lescanne, Katarzyna Grygiel. Counting and generating lambda terms. <i>Journal of Functional Programming<\/i>, 2013, 23 (05), pp.594-628. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1017\/S0956796813000178\">&#x27E8;10.1017\/S0956796813000178&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/ens-lyon.hal.science\/ensl-00879067v1\">&#x27E8;ensl-00879067&#x27E9;<\/a><\/li><li>Vincent Danos, Russ Harmer, Glynn Winskel. Constraining rule-based dynamics with types. <i>Mathematical Structures in Computer Science<\/i>, 2013, 23 (02), pp.272-289. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01976370v1\">&#x27E8;hal-01976370&#x27E9;<\/a><\/li><li>Olivier Laurent. Intersection Types with Subtyping by Means of Cut Elimination. <i>Fundamenta Informaticae<\/i>, 2012, 121 (1-4), pp.203-226. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.3233\/FI-2012-776\">&#x27E8;10.3233\/FI-2012-776&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00768868v1\">&#x27E8;hal-00768868&#x27E9;<\/a><\/li><li>Damien Pous. Untyping Typed Algebras and Colouring Cyclic Linear Logic (expanded). <i>Logical Methods in Computer Science<\/i>, 2012, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.2168\/LMCS-8(2:13)2012\">&#x27E8;10.2168\/LMCS-8(2:13)2012&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01442739v1\">&#x27E8;hal-01442739&#x27E9;<\/a><\/li><li>Tom Hirschowitz, Damien Pous. Innocent strategies as presheaves and interactive equivalences for CCS (expanded version). <i>Scientific Annals of Computer Science<\/i>, 2012, 22 (1), pp.147-199. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.7561\/SACS.2012.1.147\">&#x27E8;10.7561\/SACS.2012.1.147&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00555144v3\">&#x27E8;hal-00555144v3&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi. Duality and i\/o-Types in the \u03c0-Calculus. <i>Lecture Notes in Computer Science<\/i>, 2012, 7454, pp 302-316. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00798028v1\">&#x27E8;hal-00798028&#x27E9;<\/a><\/li><li>Olivier Laurent. Intuitionistic Dual-intuitionistic Nets. <i>Journal of Logic and Computation<\/i>, 2011, 21 (4), pp.561-587. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1093\/logcom\/exp044\">&#x27E8;10.1093\/logcom\/exp044&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00617254v1\">&#x27E8;hal-00617254&#x27E9;<\/a><\/li><li>Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi. Termination in higher-order concurrent calculi. <i>Journal of Logic and Algebraic Programming<\/i>, 2010, 79 (7), pp.550-577. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.jlap.2010.07.007\">&#x27E8;10.1016\/j.jlap.2010.07.007&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00798788v1\">&#x27E8;hal-00798788&#x27E9;<\/a><\/li><li>Damien Pous. Using Bisimulation Proof Techniques for the Analysis of Distributed Algorithms. <i>Theoretical Computer Science<\/i>, 2008, 402 (2-3), pp.199-220. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.tcs.2008.04.035\">&#x27E8;10.1016\/j.tcs.2008.04.035&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/ens-lyon.hal.science\/ensl-00149964v3\">&#x27E8;ensl-00149964v3&#x27E9;<\/a><\/li><li>Damien Pous, Daniel Hirschkoff. A Distribution Law for CCS and a New Congruence Result for the pi-calculus (expanded). <i>Logical Methods in Computer Science<\/i>, 2008, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.2168\/LMCS-4(2:4)2008\">&#x27E8;10.2168\/LMCS-4(2:4)2008&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01442744v1\">&#x27E8;hal-01442744&#x27E9;<\/a><\/li><li>Damien Pous. New Up-To Techniques for Weak Bisimulation. <i>Theoretical Computer Science<\/i>, 2007, 380, pp.164 - 180. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.tcs.2007.02.060\">&#x27E8;10.1016\/j.tcs.2007.02.060&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01442745v1\">&#x27E8;hal-01442745&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Damien Pous, Davide Sangiorgi. An Efficient Abstract Machine for Safe Ambients. <i>Journal of Logic and Algebraic Programming<\/i>, 2007, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.jlap.2007.02.003\">&#x27E8;10.1016\/j.jlap.2007.02.003&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01442746v1\">&#x27E8;hal-01442746&#x27E9;<\/a><\/li><\/ul><\/div><\/div><br><div class=\"grp-div\"><h3 class=\"wphal-titre-groupe\">Conference papers<span class=\"wphal-nbmetadata\" style=\"margin-left:10px\">181 document<\/span><\/h3><div class=\"grp-content\"><ul><li>Alohotsy Rafalimanana, Thomas Lauvaux, Charbel Abdallah, Ke Che, Mali Chariot, et al.. Impact of spatial aggregation on urban CO2 and XCO2 plume structure: Implications for high-resolution urban inversions over Paris. <i>ICOS Science Conference 2026<\/i>, ICOS (Integrated Carbon Observation System), Sep 2026, Lund, Sweden. <a target=\"_blank\" href=\"https:\/\/hal.inrae.fr\/hal-05802300v1\">&#x27E8;hal-05802300&#x27E9;<\/a><\/li><li>Thomas Lauvaux, Ke Che, Samuel Hammer, Olivier Laurent, Michel Ramonet, et al.. Urban GHG inversions over Paris (ICOS-Cities): reaching high spatial and temporal resolutions over cities. <i>ICOS Science Conference 2026<\/i>, ICOS (Integrated Carbon Observation System), Sep 2026, Lund, Sweden. <a target=\"_blank\" href=\"https:\/\/hal.inrae.fr\/hal-05802330v1\">&#x27E8;hal-05802330&#x27E9;<\/a><\/li><li>Matteo Mio, Pistone Paolo, Rodary Apolline, Vignudelli Valeria. On the Convexity of Kantorovich Liftings of Fuzzy Relations. <i>ICTCS 2026 - 11th International Conference on Information and Communication Technology for Competitive Strategies<\/i>, Luca Geatti; Carla Piazza, Sep 2026, Udine, Italy. pp.15--29. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05771413v1\">&#x27E8;hal-05771413&#x27E9;<\/a><\/li><li>Lukas Mulder, Damien Pous, Jana Wagemaker. Continuous Algebras with Hypotheses. <i>37th International Conference on Concurrency Theory (CONCUR '26)<\/i>, Sep 2026, Liverpool, United Kingdom. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CONCUR.2026.28\">&#x27E8;10.4230\/LIPIcs.CONCUR.2026.28&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05620463v2\">&#x27E8;hal-05620463v2&#x27E9;<\/a><\/li><li>Olivier Laurent, Jui-Hsuan Wu. Non-Wellfounded Derivations for Intersection Subtyping with Fixpoints. <i>Formal Structures for Computation and Deduction<\/i>, Jul 2026, Lisbonne, Portugal. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.FSCD.2026.22\">&#x27E8;10.4230\/LIPIcs.FSCD.2026.22&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05741509v1\">&#x27E8;hal-05741509&#x27E9;<\/a><\/li><li>Olivier Laurent. The Logic of Intersection Subtyping. <i>Logic in Computer Science<\/i>, Jul 2026, Lisbon, Portugal. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.LICS.2026.62\">&#x27E8;10.4230\/LIPIcs.LICS.2026.62&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05741486v1\">&#x27E8;hal-05741486&#x27E9;<\/a><\/li><li>Damien Pous. String Diagrams for Monoidal Categories, in Rocq. <i>ITP '26: 17th International Conference on Interactive Theorem Proving<\/i>, Jul 2026, Lisbonne, Portugal. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.ITP.2026.32\">&#x27E8;10.4230\/LIPIcs.ITP.2026.32&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05522044v2\">&#x27E8;hal-05522044v2&#x27E9;<\/a><\/li><li>Samuel Arsac, Russ Harmer, Damien Pous. Adhesive category theory for graph rewriting in Rocq. <i>CPP '26: 15th ACM SIGPLAN International Conference on Certified Programs and Proofs<\/i>, Jan 2026, Rennes France, France. pp.59-74, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3779031.3779105\">&#x27E8;10.1145\/3779031.3779105&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05263561v2\">&#x27E8;hal-05263561v2&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Iwan Qu\u00e9merais, Davide Sangiorgi. First-order store and visibility in name-passing calculi. <i>36th International Conference on Concurrency Theory (CONCUR 2025)<\/i>, Aug 2025, Aarhus (Denmark), Denmark. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs\">&#x27E8;10.4230\/LIPIcs&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05033251v1\">&#x27E8;hal-05033251&#x27E9;<\/a><\/li><li>R\u00e9mi Di Guardia, Olivier Laurent. A Formalization of Multiplicative Proof-Nets in Rocq. <i>9th International Workshop on Trends in Linear Logic and Applications (TLLA 2025)<\/i>, Jul 2025, Birmingham (UK), United Kingdom. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05198754v1\">&#x27E8;hal-05198754&#x27E9;<\/a><\/li><li>Colin Riba, Alexandre Kejikian. Infinitary Refinement Types for\u00a0Temporal Properties in\u00a0Scott Domains. <i>Logic, Language, Information, and Computation<\/i>, Jul 2025, Porto, Portugal. pp.175-193, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-99536-1_11\">&#x27E8;10.1007\/978-3-031-99536-1_11&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05285182v1\">&#x27E8;hal-05285182&#x27E9;<\/a><\/li><li>R\u00e9mi Di Guardia, Olivier Laurent, Lorenzo Tortora de Falco, Lionel Vaux Auclair. Yeo\u2019s Theorem for Locally Colored Graphs: the Path to Sequentialization in Linear Logic. <i>10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025)<\/i>, Jul 2025, Birmingham, United Kingdom. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.FSCD.2025.16\">&#x27E8;10.4230\/LIPIcs.FSCD.2025.16&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05149336v1\">&#x27E8;hal-05149336&#x27E9;<\/a><\/li><li>Simon Iosti, Denis Kuperberg, Quentin Moreau. Positive and monotone fragments of FO and LTL. <i>ICALP<\/i>, Jul 2025, Aarhus (Danemark), Denmark. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.ICALP.2025.162\">&#x27E8;10.4230\/LIPIcs.ICALP.2025.162&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04774430v2\">&#x27E8;hal-04774430v2&#x27E9;<\/a><\/li><li>Matteo Mio. Compact Quantitative Theories of Convex Algebras. <i>MFPS 2025 - 41st Conference on Mathematical Foundations of Programming Semantics<\/i>, Clemens Kupke; Stefan Milius, Jun 2025, Glasgow, United Kingdom. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.46298\/ENTICS.16876\">&#x27E8;10.46298\/ENTICS.16876&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05771403v1\">&#x27E8;hal-05771403&#x27E9;<\/a><\/li><li>Samuel Humeau, Daniela Petrisan, Jurriaan Rot. Correspondences between codensity and coupling-based liftings, a practical approach. <i>33rd EACSL Annual Conference on Computer Science Logic (CSL 2025)<\/i>, Feb 2025, Amsterdam, Netherlands. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CSL.2025.29\">&#x27E8;10.4230\/LIPIcs.CSL.2025.29&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04789352v4\">&#x27E8;hal-04789352v4&#x27E9;<\/a><\/li><li>Ugo Dal Lago, Zeinab Galal, Giulia Giusti. On Computational Indistinguishability and\u00a0Logical Relations. <i>APLAS 2024 - 22nd Asian Symposium on Programming Languages and Systems<\/i>, Oct 2024, Kyoto, Japan. pp.241-263, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-981-97-8943-6_12\">&#x27E8;10.1007\/978-981-97-8943-6_12&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-04834943v1\">&#x27E8;hal-04834943&#x27E9;<\/a><\/li><li>Amina Doumane, Samuel Humeau, Damien Pous. A finite presentation of graphs of treewidth at most three. <i>51st International Colloquium on Automata, Languages, and Programming (ICALP 2024).<\/i>, Jul 2024, Tallinn, Estonia. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.ICALP.2024.135\">&#x27E8;10.4230\/LIPIcs.ICALP.2024.135&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04560570v3\">&#x27E8;hal-04560570v3&#x27E9;<\/a><\/li><li>Miko\u0142aj Boja\u0144czyk, L\u00ea Th\u00e0nh D\u0169ng Nguy\u1ec5n, Rafa\u0142 Stefa\u0144ski. Function Spaces for Orbit-Finite Sets. <i>51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)<\/i>, Jul 2024, Tallinn, Estonia. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.ICALP.2024.130\">&#x27E8;10.4230\/LIPIcs.ICALP.2024.130&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04634408v1\">&#x27E8;hal-04634408&#x27E9;<\/a><\/li><li>Davide Barbarossa, Paolo Pistone. Tropical Mathematics and the Lambda-Calculus I: Metric and Differential Analysis of Effectful Programs. <i>Computer Science Logic 2024 (CSL 2024)<\/i>, Feb 2024, Napoli, France. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CSL.2024.14\">&#x27E8;10.4230\/LIPIcs.CSL.2024.14&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04777395v1\">&#x27E8;hal-04777395&#x27E9;<\/a><\/li><li>Vincent Moreau, L\u00ea Th\u00e0nh D\u0169ng Nguy\u1ec5n. Syntactically and Semantically Regular Languages of \u03bb-Terms Coincide Through Logical Relations. <i>32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)<\/i>, Feb 2024, Naples, Italy. pp.40:1-40:22, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CSL.2024.40\">&#x27E8;10.4230\/LIPIcs.CSL.2024.40&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04447910v1\">&#x27E8;hal-04447910&#x27E9;<\/a><\/li><li>Melissa Antonelli, Ugo Dal Lago, Davide Davoli, Isabel Oitavem, Paolo Pistone. Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories. <i>CSL 2024 - 32nd EACSL Annual Conference on Computer Science Logic<\/i>, Feb 2024, Napoli, Italy. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CSL.2024.10\">&#x27E8;10.4230\/LIPIcs.CSL.2024.10&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04777376v1\">&#x27E8;hal-04777376&#x27E9;<\/a><\/li><li>Colin Riba, Solal Stern. Liveness Properties in Geometric Logic for Domain-Theoretic Streams. <i>35es Journ\u00e9es Francophones des Langages Applicatifs (JFLA 2024)<\/i>, Jan 2024, Saint-Jacut-de-la-Mer, France. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-04406332v1\">&#x27E8;hal-04406332&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Enguerrand Prebet. Using Pi-Calculus Names as Locks. <i>Proceedings Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantics, EXPRESS\/SOS 2023, and 20th Workshop on Structural Operational Semantics<\/i>, Sep 2023, Antwerp, Belgium. pp.76--96, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4204\/EPTCS.387.7\">&#x27E8;10.4204\/EPTCS.387.7&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04406112v1\">&#x27E8;hal-04406112&#x27E9;<\/a><\/li><li>Nicolas Behr, Russ Harmer. A living monograph for\u00a0graph transformation. <i>16th International Conference on Graph Transformation (ICGT 2023)<\/i>, Jul 2023, Leicester, United Kingdom. pp.281-291, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-36709-0_15\">&#x27E8;10.1007\/978-3-031-36709-0_15&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04177321v1\">&#x27E8;hal-04177321&#x27E9;<\/a><\/li><li>Miko\u0142aj Boja\u0144czyk, L\u00ea Th\u00e0nh D\u0169ng Nguy\u1ec5n. Algebraic Recognition of Regular Functions. <i>50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)<\/i>, Jul 2023, Paderborn, Germany. pp.117:1-117:19, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.ICALP.2023.117\">&#x27E8;10.4230\/LIPIcs.ICALP.2023.117&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03985883v2\">&#x27E8;hal-03985883v2&#x27E9;<\/a><\/li><li>R\u00e9mi Di Guardia, Olivier Laurent. Type Isomorphisms for Multiplicative-Additive Linear Logic. <i>8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023)<\/i>, Jul 2023, Rome, Italy. pp.26:1-21, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.FSCD.2023.26\">&#x27E8;10.4230\/LIPIcs.FSCD.2023.26&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04082204v2\">&#x27E8;hal-04082204v2&#x27E9;<\/a><\/li><li>R\u00e9mi Di Guardia, Olivier Laurent, Lionel Vaux, Lorenzo Tortora de Falco. Sequentialization is as fun as bungee jumping. <i>7th International Workshop on Trends in Linear Logic and Applications (TLLA 2023)<\/i>, Jul 2023, Rome Sapienza Universita di Roma, Italy. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04515300v1\">&#x27E8;hal-04515300&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Guilhem Jaber, Enguerrand Prebet. Deciding contextual equivalence of \u03bd-calculus with effectful contexts (full version). <i>Foundations of Software Science and Computation Structures - 26th International Conference, FoSSaCS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023.<\/i>, Apr 2023, Paris, France. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-30829-1_2\">&#x27E8;10.1007\/978-3-031-30829-1_2&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03955303v1\">&#x27E8;hal-03955303&#x27E9;<\/a><\/li><li>Emile Hazard, Denis Kuperberg. Explorable Automata. <i>CSL 2023<\/i>, Feb 2023, Warsaw, Poland. pp.24:1--24:18, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CSL.2023.24\">&#x27E8;10.4230\/LIPIcs.CSL.2023.24&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03669659v2\">&#x27E8;hal-03669659v2&#x27E9;<\/a><\/li><li>Damien Pous, Jana Wagemaker. Completeness Theorems for Kleene Algebra with Top. <i>CONCUR<\/i>, Sep 2022, Varsovie, Poland. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CONCUR.2022.26\">&#x27E8;10.4230\/LIPIcs.CONCUR.2022.26&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03644317v2\">&#x27E8;hal-03644317v2&#x27E9;<\/a><\/li><li>David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin. Bouncing threads for circular and non-wellfounded proofs -- Towards compositionality with circular proofs (Extended version). <i>LICS '22: Proceedings of the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science<\/i>, Aug 2022, Haifa, Israel. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3531130.3533375\">&#x27E8;10.1145\/3531130.3533375&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03682126v1\">&#x27E8;hal-03682126&#x27E9;<\/a><\/li><li>Matteo Mio, Ralph Sarkis, Valeria Vignudelli. Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning. <i>LICS '22: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science<\/i>, Aug 2022, Haifa Israel, France. pp.1-13, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3531130.3533366\">&#x27E8;10.1145\/3531130.3533366&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03790273v1\">&#x27E8;hal-03790273&#x27E9;<\/a><\/li><li>R\u00e9mi Di Guardia, Olivier Laurent. Bottom-Up Sequentialization of Unit-Free MALL Proof Nets. <i>3rd Joint International Workshop on Linearity and Trends in Linear Logic and its Applications (Linearity &amp; TLLA 2022)<\/i>, Jul 2022, Haifa, Israel. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03719939v1\">&#x27E8;hal-03719939&#x27E9;<\/a><\/li><li>Alexandre Goy. Weakening and Iterating Laws using String Diagrams. <i>MFPS XXXVIII<\/i>, Jul 2022, Ithaca, NY, United States. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.46298\/entics.10482\">&#x27E8;10.46298\/entics.10482&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04085131v1\">&#x27E8;hal-04085131&#x27E9;<\/a><\/li><li>Enguerrand Prebet. Functions and References in the Pi-Calculus: Full Abstraction and Proof Techniques. <i>ICALP 2022 - 49th International Colloquium on Automata, Languages, and Programming<\/i>, Jul 2022, Paris, France. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.ICALP.2022.114\">&#x27E8;10.4230\/LIPIcs.ICALP.2022.114&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03920025v1\">&#x27E8;hal-03920025&#x27E9;<\/a><\/li><li>Amina Doumane. Regular expressions for tree-width 2 graphs. <i>International Colloquium on Automata, Languages and Programming<\/i>, Jul 2022, Paris, France. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.ICALP.2022.121\">&#x27E8;10.4230\/LIPIcs.ICALP.2022.121&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03753626v1\">&#x27E8;hal-03753626&#x27E9;<\/a><\/li><li>Damien Pous, Jurriaan Rot, Ruben Turkenburg. Corecursion up-to via Causal Transformations. <i>16th International Workshop on Coalgebraic Methods in Computer Science (CMCS)<\/i>, Apr 2022, Munich, Germany. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-10736-8_7\">&#x27E8;10.1007\/978-3-031-10736-8_7&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03694381v1\">&#x27E8;hal-03694381&#x27E9;<\/a><\/li><li>L\u00ea Th\u00e0nh Dung Nguy\u00ean, Lutz Stra\u00dfburger. BV and Pomset Logic Are Not the Same. <i>CSL 2022 - 30th EACSL Annual Conference on Computer Science Logic<\/i>, Feb 2022, G\u00f6ttingen, Germany. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CSL.2022.32\">&#x27E8;10.4230\/LIPIcs.CSL.2022.32&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-03909463v1\">&#x27E8;hal-03909463&#x27E9;<\/a><\/li><li>Emile Hazard, Denis Kuperberg. Cyclic proofs for transfinite expressions. <i>30th EACSL Annual Conference on Computer Science Logic (CSL 2022)<\/i>, Feb 2022, G\u00f6ttingen, Germany. pp.23, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CSL.2022.23\">&#x27E8;10.4230\/LIPIcs.CSL.2022.23&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03669657v1\">&#x27E8;hal-03669657&#x27E9;<\/a><\/li><li>Amina Doumane. The class of representable semilattice-ordered monoids is not a variety. <i>RAMICS<\/i>, Nov 2021, Marseille, France. pp.144-158, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-88701-8_9\">&#x27E8;10.1007\/978-3-030-88701-8_9&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03404551v1\">&#x27E8;hal-03404551&#x27E9;<\/a><\/li><li>Christophe Lucas, Matteo Mio. Free Modal Riesz Spaces are Archimedean: A Syntactic Proof. <i>9th International Conference on Relational and Algebraic Methods in Computer Science RAMICS 2021<\/i>, Uli Fahrenberg Mai Gehrke Luigi Santocanale Michael Winter, Nov 2021, Marseille, France. pp.275 - 291, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-88701-8_17\">&#x27E8;10.1007\/978-3-030-88701-8_17&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03451342v1\">&#x27E8;hal-03451342&#x27E9;<\/a><\/li><li>Damien Pous, Jurriaan Rot, Jana Wagemaker. On Tools for Completeness of Kleene Algebra with Hypotheses. <i>19th International Conference on Relational and Algebraic Methods in Computer Science ( RAMICS 2021 )<\/i>, Nov 2021, Luminy, France. pp.378-395, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-88701-8_23\">&#x27E8;10.1007\/978-3-030-88701-8_23&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03269462v2\">&#x27E8;hal-03269462v2&#x27E9;<\/a><\/li><li>Filippo Bonchi, Ana Sokolova, Valeria Vignudelli. Presenting convex sets of probability distributions by convex semilattices and unique bases. <i>9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021)<\/i>, Aug 2021, Salzburg, Austria. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CALCO.2021.11\">&#x27E8;10.4230\/LIPIcs.CALCO.2021.11&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03615765v1\">&#x27E8;hal-03615765&#x27E9;<\/a><\/li><li>Daniela Petri\u015fan, Ralph Sarkis. Semialgebras and Weak Distributive Laws. <i>Proceedings 37th Conference on Mathematical Foundations of Programming Semantics, {MFPS} 2021, Hybrid: Salzburg, Austria and Online, 30th August - 2nd September, 2021<\/i>, Aug 2021, Salzburg, Austria. pp.218--241, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4204\/EPTCS.351.14\">&#x27E8;10.4204\/EPTCS.351.14&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03261093v3\">&#x27E8;hal-03261093v3&#x27E9;<\/a><\/li><li>Patrick Baillot, Alexis Ghyselen, Naoki Kobayashi. Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes. <i>32nd International Conference on Concurrency Theory, CONCUR 2021<\/i>, Aug 2021, Virtual conference, France. pp.34:1--34:22, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPICS.CONCUR.2021.34\">&#x27E8;10.4230\/LIPICS.CONCUR.2021.34&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03198277v2\">&#x27E8;hal-03198277v2&#x27E9;<\/a><\/li><li>Amina Doumane. Graph characterization of the universal theory of relations. <i>Mathematical foundations of computer science<\/i>, Aug 2021, Tallin, Estonia. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.MFCS.2021.11\">&#x27E8;10.4230\/LIPIcs.MFCS.2021.11&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03226221v1\">&#x27E8;hal-03226221&#x27E9;<\/a><\/li><li>Lison Blondeau-Patissier, Pierre Clairambault. Positional Injectivity for Innocent Strategies. <i>6TH INTERNATIONAL CONFERENCE ON FORMAL STRUCTURES FOR COMPUTATION AND DEDUCTION<\/i>, Jul 2021, Buenos Aires, Argentina. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.FSCD.2021.17\">&#x27E8;10.4230\/LIPIcs.FSCD.2021.17&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03218198v1\">&#x27E8;hal-03218198&#x27E9;<\/a><\/li><li>Liron Cohen, \u00c9tienne Miquey, Ross Tate. Evidenced Frames: A Unifying Framework Broadening Realizability Models. <i>LICS 2021<\/i>, Jul 2021, Rome, Italy. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/LICS52264.2021.9470514\">&#x27E8;10.1109\/LICS52264.2021.9470514&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-03422961v1\">&#x27E8;hal-03422961&#x27E9;<\/a><\/li><li>Denis Kuperberg. Positive First-order Logic on Words. <i>2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)<\/i>, Jun 2021, Rome, France. pp.1-13, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/LICS52264.2021.9470602\">&#x27E8;10.1109\/LICS52264.2021.9470602&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03375096v1\">&#x27E8;hal-03375096&#x27E9;<\/a><\/li><li>Matteo Mio, Ralph Sarkis, Valeria Vignudelli. Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning. <i>2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)<\/i>, Jun 2021, Rome, Italy. pp.1-14, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/LICS52264.2021.9470717\">&#x27E8;10.1109\/LICS52264.2021.9470717&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-03451353v1\">&#x27E8;hal-03451353&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Enguerrand Prebet, Davide Sangiorgi. On sequentiality and well-bracketing in the \u03c0-calculus. <i>LICS 2021 - 36th Annual ACM\/IEEE Symposium on Logic in Computer Science<\/i>, Jun 2021, Rome, Italy. pp.1-13, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/LICS52264.2021.9470559\">&#x27E8;10.1109\/LICS52264.2021.9470559&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03203191v2\">&#x27E8;hal-03203191v2&#x27E9;<\/a><\/li><li>Etienne Callies, Olivier Laurent. Click and coLLecT An Interactive Linear Logic Prover. <i>5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021)<\/i>, Jun 2021, Rome (virtual), Italy. <a target=\"_blank\" href=\"https:\/\/hal-lirmm.ccsd.cnrs.fr\/lirmm-03271501v1\">&#x27E8;lirmm-03271501&#x27E9;<\/a><\/li><li>Russ Harmer, Nicolas Behr, Jean Krivine. Concurrency Theorems for Non-linear Rewriting Theories. <i>ICGT 2021 - 14th International Conference on Graph Transformation<\/i>, Jun 2021, Bergen, Norway. pp.3-21, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-78946-6_1\">&#x27E8;10.1007\/978-3-030-78946-6_1&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03358036v1\">&#x27E8;hal-03358036&#x27E9;<\/a><\/li><li>Guilhem Jaber, Colin Riba. Temporal Refinements for Guarded Recursive Types. <i>ESOP 2021 - 30th European Symposium on Programming<\/i>, Mar 2021, Luxembourg, Luxembourg. pp.548-578, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-72019-3_20\">&#x27E8;10.1007\/978-3-030-72019-3_20&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03517430v1\">&#x27E8;hal-03517430&#x27E9;<\/a><\/li><li>Patrick Baillot, Alexis Ghyselen. Types for Complexity of Parallel Computation in Pi-Calculus. <i>30th European Symposium on Programming (ESOP 2021)<\/i>, Mar 2021, Luxembourg, Luxembourg. pp.59-86, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-72019-3\\_3\">&#x27E8;10.1007\/978-3-030-72019-3\\_3&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03126973v1\">&#x27E8;hal-03126973&#x27E9;<\/a><\/li><li>Han\u00e2 Lbath, Angela Bonifati, Russ Harmer. Schema Inference for Property Graphs. <i>EDBT 2021 - 24th International Conference on Extending Database Technology<\/i>, Mar 2021, Nicosia, Cyprus. pp.499-504, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.5441\/002\/edbt.2021.58\">&#x27E8;10.5441\/002\/edbt.2021.58&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03361480v1\">&#x27E8;hal-03361480&#x27E9;<\/a><\/li><li>Bruno Dinis, \u00c9tienne Miquey. Realizability with stateful computations for nonstandard analysis. <i>CSL 2021 - Computer Science Logic<\/i>, Jan 2021, Ljubljana, Slovenia. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03002239v1\">&#x27E8;hal-03002239&#x27E9;<\/a><\/li><li>Olivier Laurent. An Anti-Locally-Nameless Approach to Formalizing Quantifiers. <i>Certified Programs and Proofs<\/i>, Jan 2021, virtual, Denmark. pp.300-312, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3437992.3439926\">&#x27E8;10.1145\/3437992.3439926&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03096253v1\">&#x27E8;hal-03096253&#x27E9;<\/a><\/li><li>Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Micha\u0142 Skrzypczak. On the Succinctness of Alternating Parity Good-for-Games Automata. <i>FSTTCS 2020<\/i>, Dec 2020, Goa, India. pp.41:1--41:13, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.FSTTCS.2020.41\">&#x27E8;10.4230\/LIPIcs.FSTTCS.2020.41&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03046213v1\">&#x27E8;hal-03046213&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Enguerrand Prebet, Davide Sangiorgi. On the Representation of References in the Pi-Calculus. <i>CONCUR 2020 - 31st International Conference on Concurrency Theory<\/i>, Dec 2020, Vienna \/ Virtual, Austria. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CONCUR.2020.34\">&#x27E8;10.4230\/LIPIcs.CONCUR.2020.34&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03053368v1\">&#x27E8;hal-03053368&#x27E9;<\/a><\/li><li>Matteo Mio, Valeria Vignudelli. Monads and Quantitative Equational Theories for Nondeterminism and Probability. <i>CONCUR 2020<\/i>, Sep 2020, Vienna (on line), Austria. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CONCUR.2020.28\">&#x27E8;10.4230\/LIPIcs.CONCUR.2020.28&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03028173v1\">&#x27E8;hal-03028173&#x27E9;<\/a><\/li><li>Denis Kuperberg, Jan Martens. Regular resynchronizability of origin transducers is undecidable. <i>MFCS<\/i>, Aug 2020, Prague, Czech Republic. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.MFCS.2020.51\">&#x27E8;10.4230\/LIPIcs.MFCS.2020.51&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03046161v1\">&#x27E8;hal-03046161&#x27E9;<\/a><\/li><li>Miko\u0142aj Boja\u0144czyk, Amina Doumane. First-order tree-to-tree functions. <i>LICS<\/i>, Aug 2020, Saarbr\u00fccken, Germany. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3373718.3394785\">&#x27E8;10.1145\/3373718.3394785&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03404542v1\">&#x27E8;hal-03404542&#x27E9;<\/a><\/li><li>Esa\u00efe Bauer, Olivier Laurent. Super Exponentials in Linear Logic. <i>Second Joint International Workshop on Linearity &amp; Trends in Linear Logic and Applications<\/i>, Jun 2020, Paris, France. pp.50-73, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4204\/EPTCS.353.3\">&#x27E8;10.4204\/EPTCS.353.3&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03514536v1\">&#x27E8;hal-03514536&#x27E9;<\/a><\/li><li>Christian Doczkal, Damien Pous. Completeness of an Axiomatization of Graph Isomorphism via Graph Rewriting in Coq. <i>CPP 2020 - 9th ACM SIGPLAN International Conference on Certified Programs and Proofs<\/i>, Jan 2020, New Orleans, LA, United States. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3372885.3373831\">&#x27E8;10.1145\/3372885.3373831&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02333553v3\">&#x27E8;hal-02333553v3&#x27E9;<\/a><\/li><li>Amina Doumane, Damien Pous. Non axiomatisability of positive relation algebras with constants, via graph homomorphisms. <i>CONCUR<\/i>, 2020, Vienne, Austria. pp.1-23, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CONCUR.2020.49\">&#x27E8;10.4230\/LIPIcs.CONCUR.2020.49&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02870687v2\">&#x27E8;hal-02870687v2&#x27E9;<\/a><\/li><li>Denis Kuperberg, Laureline Pinault, Damien Pous. Cyclic Proofs and Jumping Automata. <i>FSTTCS<\/i>, Dec 2019, Bombay, India. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.FSTTCS.2019.45\">&#x27E8;10.4230\/LIPIcs.FSTTCS.2019.45&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02301651v2\">&#x27E8;hal-02301651v2&#x27E9;<\/a><\/li><li>Angela Bonifati, Peter Furniss, Alastair Green, Russ Harmer, Eugenia Oshurko, et al.. Schema validation and evolution for graph databases. <i>ER 2019 - 38th International Conference on Conceptual Modeling<\/i>, Nov 2019, Salvador, Brazil. pp.448-456, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-33223-5_37\">&#x27E8;10.1007\/978-3-030-33223-5_37&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02138771v1\">&#x27E8;hal-02138771&#x27E9;<\/a><\/li><li>Russ Harmer, Eugenia Oshurko. KAMIStudio: an environment for biocuration of cell signalling knowledge. <i>17th International Conference on Computational Methods in Systems Biology<\/i>, Sep 2019, Trieste, Italy. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02138766v1\">&#x27E8;hal-02138766&#x27E9;<\/a><\/li><li>Florent Br\u00e9hard, Assia Mahboubi, Damien Pous. A certificate-based approach to formally verified approximations. <i>ITP 2019 - Tenth International Conference on Interactive Theorem Proving<\/i>, Sep 2019, Portland, United States. pp.1-19, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.ITP.2019.8\">&#x27E8;10.4230\/LIPIcs.ITP.2019.8&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/laas.hal.science\/hal-02088529v2\">&#x27E8;hal-02088529v2&#x27E9;<\/a><\/li><li>Pierre Clairambault, Andrzej Murawski. On the Expressivity of Linear Recursion Schemes. <i>44th International Symposium on Mathematical Foundations of Computer Science<\/i>, Aug 2019, Aachen, Germany. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.MFCS.2019.50\">&#x27E8;10.4230\/LIPIcs.MFCS.2019.50&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02313542v1\">&#x27E8;hal-02313542&#x27E9;<\/a><\/li><li>Marc de Visme. Event structures for mixed choice. <i>The 30th International Conference on Concurrency Theory, CONCUR 2019<\/i>, Aug 2019, Amsterdam, Netherlands. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02167420v1\">&#x27E8;hal-02167420&#x27E9;<\/a><\/li><li>Simon Iosti, Denis Kuperberg. Eventually Safe Languages. <i>Developments in Language Theory<\/i>, Aug 2019, Varsovie, Poland. pp.192-205, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-24886-4_14\">&#x27E8;10.1007\/978-3-030-24886-4_14&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02348828v1\">&#x27E8;hal-02348828&#x27E9;<\/a><\/li><li>Denis Kuperberg, Laureline Pinault, Damien Pous. Coinductive algorithms for B\u00fcchi automata. <i>Developments in Language Theory<\/i>, Aug 2019, Varsovie, Poland. pp.206-220, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-24886-4_15\">&#x27E8;10.1007\/978-3-030-24886-4_15&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01928701v1\">&#x27E8;hal-01928701&#x27E9;<\/a><\/li><li>Russ Harmer, Eugenia Oshurko. Knowledge representation and update in hierarchies of graphs. <i>International Conference on Graph Transformation<\/i>, Jul 2019, Eindhoven, Netherlands. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02127178v1\">&#x27E8;hal-02127178&#x27E9;<\/a><\/li><li>Florent Br\u00e9hard, Mioara Joldes, Jean-Bernard Lasserre. On Moment Problems with Holonomic Functions. <i>44th International Symposium on Symbolic and Algebraic Computation (ISSAC 2019)<\/i>, Jul 2019, P\u00e9kin, China. pp.66-73. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02006645v1\">&#x27E8;hal-02006645&#x27E9;<\/a><\/li><li>L\u00ea Th\u00e0nh D\u0169ng Nguy\u1ec5n, C\u00e9cilia Pradic. From normal functors to logarithmic space queries. <i>46th International Colloquium on Automata, Languages and Programming (ICALP 2019)<\/i>, Jul 2019, Patras, Greece. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.ICALP.2019.123\">&#x27E8;10.4230\/LIPIcs.ICALP.2019.123&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02024152v3\">&#x27E8;hal-02024152v3&#x27E9;<\/a><\/li><li>Filippo Bonchi, Ana Sokolova, Valeria Vignudelli. The Theory of Traces for Systems with Nondeterminism and Probability. <i>Logic in Computer Science (LICS) 2019<\/i>, Jun 2019, Vancouver, Canada. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02187093v1\">&#x27E8;hal-02187093&#x27E9;<\/a><\/li><li>Denis Arzelier, Florent Br\u00e9hard, Mioara Joldes. Exchange algorithm for evaluation and approximation error-optimized polynomials. <i>ARITH 2019 - 26th IEEE Symposium on Computer Arithmetic<\/i>, Jun 2019, Kyoto, Japan. pp.1-8. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02006606v1\">&#x27E8;hal-02006606&#x27E9;<\/a><\/li><li>Marc de Visme, Glynn Winskel. Causal Unfoldings. <i>8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)<\/i>, Jun 2019, London, United Kingdom. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CONCUR.2019.11\">&#x27E8;10.4230\/LIPIcs.CONCUR.2019.11&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02863476v1\">&#x27E8;hal-02863476&#x27E9;<\/a><\/li><li>Damien Pous. Coinduction: Automata, Formal Proof, Companions (Invited Paper). <i>CALCO<\/i>, Jun 2019, London, United Kingdom. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CALCO.2019.4\">&#x27E8;10.4230\/LIPIcs.CALCO.2019.4&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02393982v1\">&#x27E8;hal-02393982&#x27E9;<\/a><\/li><li>Christophe Lucas, Matteo Mio. Towards a Structural Proof Theory of Probabilistic mu-Calculi. <i>FoSSaCS<\/i>, Apr 2019, Prague, Czech Republic. pp.418-435. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02136732v1\">&#x27E8;hal-02136732&#x27E9;<\/a><\/li><li>Aurore Alcolei, Pierre Clairambault, Olivier Laurent. Resource-Tracking Concurrent Games. <i>Foundations of Software Science and Computation Structures<\/i>, Apr 2019, Prague, Czech Republic. pp.27-44, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-17127-8_2\">&#x27E8;10.1007\/978-3-030-17127-8_2&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02096306v1\">&#x27E8;hal-02096306&#x27E9;<\/a><\/li><li>C\u00e9cilia Pradic, Colin Riba. A Dialectica-Like Interpretation of a Linear MSO on Infinite Words. <i>FOSSACS'19<\/i>, Apr 2019, Prague, Czech Republic. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01925701v1\">&#x27E8;hal-01925701&#x27E9;<\/a><\/li><li>Henning Basold. Coinduction in Flow: The Later Modality in Fibrations. <i>CALCO 2019<\/i>, 2019, London, United Kingdom. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CALCO.2019.8\">&#x27E8;10.4230\/LIPIcs.CALCO.2019.8&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04922302v1\">&#x27E8;hal-04922302&#x27E9;<\/a><\/li><li>Amina Doumane, Denis Kuperberg, Damien Pous, C\u00e9cilia Pradic. Kleene Algebra with Hypotheses. <i>22nd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS)<\/i>, 2019, Prague, Czech Republic. pp.207-223, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-17127-8_12\">&#x27E8;10.1007\/978-3-030-17127-8_12&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02021315v2\">&#x27E8;hal-02021315v2&#x27E9;<\/a><\/li><li>Henning Basold, Ekaterina Komendantskaya, Yue Li. Coinduction in Uniform: Foundations for Corecursive Proof Search with Horn Clauses. <i>ESOP 2019<\/i>, 2019, Prague, Czech Republic. pp.783-813, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-17184-1_28\">&#x27E8;10.1007\/978-3-030-17184-1_28&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04922300v1\">&#x27E8;hal-04922300&#x27E9;<\/a><\/li><li>Anupam Das, Amina Doumane, Damien Pous. Left-Handed Completeness for Kleene algebra, via Cyclic Proofs. <i>LPAR-22<\/i>, Nov 2018, Awassa, Ethiopia. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01940378v1\">&#x27E8;hal-01940378&#x27E9;<\/a><\/li><li>Romain Serra, Denis Arzelier, Florent Br\u00e9hard, Mioara Joldes. Fuel-optimal impulsive fixed-time trajectories in the linearized circular restricted 3-body-problem. <i>IAC 2018 - 69th International Astronautical Congress; IAF Astrodynamics Symposium<\/i>, International Astronautical Federation, Oct 2018, Bremen, Germany. pp.1-9. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01830253v1\">&#x27E8;hal-01830253&#x27E9;<\/a><\/li><li>Anupam Das, Damien Pous. Non-wellfounded proof theory for (Kleene+action)(algebras+lattices). <i>Computer Science Logic (CSL)<\/i>, Sep 2018, Birmingham, United Kingdom. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CSL.2018.19\">&#x27E8;10.4230\/LIPIcs.CSL.2018.19&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01703942v3\">&#x27E8;hal-01703942v3&#x27E9;<\/a><\/li><li>Aurore Alcolei, Pierre Clairambault, Martin Hyland, Glynn Winskel. The True Concurrency of Herbrand\u2019s Theorem. <i>27th EACSL Annual Conference on Computer Science Logic (CSL 2018)<\/i>, Sep 2018, Birmingham, United Kingdom. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CSL.2018.5\">&#x27E8;10.4230\/LIPIcs.CSL.2018.5&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01886968v1\">&#x27E8;hal-01886968&#x27E9;<\/a><\/li><li>Pierre Clairambault, Hugo Paquet. Fully Abstract Models of the Probabilistic \u03bb-calculus. <i>27th EACSL Annual Conference on Computer Science Logic (CSL 2018)<\/i>, Sep 2018, Birmingham, United Kingdom. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CSL.2018.16\">&#x27E8;10.4230\/LIPIcs.CSL.2018.16&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01886956v1\">&#x27E8;hal-01886956&#x27E9;<\/a><\/li><li>Patrick Baillot, Alexis Ghyselen. Combining Linear Logic and Size Types for Implicit Complexity. <i>Conference on Computer Science Logic, CSL 2018<\/i>, Sep 2018, Birmingham, France. pp.9:1--9:21. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01948196v1\">&#x27E8;hal-01948196&#x27E9;<\/a><\/li><li>Amina Doumane, Damien Pous. Completeness for Identity-free Kleene Lattices. <i>CONCUR<\/i>, Sep 2018, Beijing, China. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CONCUR.2018.18\">&#x27E8;10.4230\/LIPIcs.CONCUR.2018.18&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01780845v2\">&#x27E8;hal-01780845v2&#x27E9;<\/a><\/li><li>Christian Doczkal, Damien Pous. Treewidth-Two Graphs as a Free Algebra. <i>Mathematical Foundations of Computer Science<\/i>, Aug 2018, Liverpool, United Kingdom. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.MFCS.2018.60\">&#x27E8;10.4230\/LIPIcs.MFCS.2018.60&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01780844v3\">&#x27E8;hal-01780844v3&#x27E9;<\/a><\/li><li>Florent Br\u00e9hard. A Newton-like Validation Method for Chebyshev Approximate Solutions of Linear Ordinary Differential Systems. <i>ISSAC 2018 - 43rd International Symposium on Symbolic and Algebraic Computation<\/i>, Jul 2018, New York, United States. pp.103-110, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3208976.3209000\">&#x27E8;10.1145\/3208976.3209000&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01654396v2\">&#x27E8;hal-01654396v2&#x27E9;<\/a><\/li><li>Simon Castellan, Pierre Clairambault, Hugo Paquet, Glynn Winskel. The concurrent game semantics of Probabilistic PCF. <i>the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2018)<\/i>, Jul 2018, Oxford, France. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3209108.3209187\">&#x27E8;10.1145\/3209108.3209187&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01886965v1\">&#x27E8;hal-01886965&#x27E9;<\/a><\/li><li>Olivier Laurent. Around Classical and Intuitionistic Linear Logics. <i>the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science<\/i>, Jul 2018, Oxford, United Kingdom. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3209108.3209132\">&#x27E8;10.1145\/3209108.3209132&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01840882v1\">&#x27E8;hal-01840882&#x27E9;<\/a><\/li><li>Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi. Eager Functions as Processes. <i>the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)<\/i>, Jul 2018, Oxford, United Kingdom. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3209108.3209152\">&#x27E8;10.1145\/3209108.3209152&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01917255v2\">&#x27E8;hal-01917255v2&#x27E9;<\/a><\/li><li>C\u00e9cilia Pradic, Colin Riba. LMSO: A Curry-Howard Approach to Church's Synthesis via Linear Logic. <i>LICS'18<\/i>, Jul 2018, Oxford, United Kingdom. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01698648v2\">&#x27E8;hal-01698648v2&#x27E9;<\/a><\/li><li>Matteo Mio. Riesz Modal Logic with Threshold Operators. <i>the 33rd Annual ACM\/IEEE Symposium<\/i>, Jul 2018, Oxford, France. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3209108.3209118\">&#x27E8;10.1145\/3209108.3209118&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01872130v1\">&#x27E8;hal-01872130&#x27E9;<\/a><\/li><li>Olivier Laurent. Intersection Subtyping with Constructors. <i>Twelfth Workshop on Developments in Computational Models and Ninth Workshop on Intersection Types and Related Systems<\/i>, Jul 2018, Oxford, United Kingdom. pp.73-84, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4204\/EPTCS.293.6\">&#x27E8;10.4204\/EPTCS.293.6&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02159762v1\">&#x27E8;hal-02159762&#x27E9;<\/a><\/li><li>Damien Pous, Valeria Vignudelli. Allegories: decidability and graph homomorphisms. <i>Logic in Computer Science<\/i>, Jul 2018, Oxford, United Kingdom. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3209108.3209172\">&#x27E8;10.1145\/3209108.3209172&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01703906v2\">&#x27E8;hal-01703906v2&#x27E9;<\/a><\/li><li>Christian Doczkal, Guillaume Combette, Damien Pous. A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs. <i>Interactive Theorem Proving<\/i>, Jul 2018, Oxford, United Kingdom. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-94821-8_11\">&#x27E8;10.1007\/978-3-319-94821-8_11&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01703922v2\">&#x27E8;hal-01703922v2&#x27E9;<\/a><\/li><li>Simon Castellan, Pierre Clairambault, Jonathan Hayman, Glynn Winskel. Non-angelic Concurrent Game Semantics. <i>21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2018)<\/i>, Apr 2018, Thessaloniki, Greece. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-89366-2_1\">&#x27E8;10.1007\/978-3-319-89366-2_1&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01886951v1\">&#x27E8;hal-01886951&#x27E9;<\/a><\/li><li>Guilhem Jaber, Nikos Tzevelekos. A Trace Semantics for System F Parametric Polymorphism. <i>International Conference on Foundations of Software Science and Computation Structures<\/i>, Apr 2018, Thessaloniki, Greece. pp.20-38, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-89366-2_2\">&#x27E8;10.1007\/978-3-319-89366-2_2&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02083207v1\">&#x27E8;hal-02083207&#x27E9;<\/a><\/li><li>Damien Pous. On the Positive Calculus of Relations with Transitive Closure. <i>35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)<\/i>, Feb 2018, Caen, France. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.STACS.2018.3\">&#x27E8;10.4230\/LIPIcs.STACS.2018.3&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01718925v1\">&#x27E8;hal-01718925&#x27E9;<\/a><\/li><li>Paulo Ricardo Arantes Gilz, Florent Br\u00e9hard, Cl\u00e9ment Gazzino. Validated Semi-Analytical Transition Matrices for Linearized Relative Spacecraft Dynamics via Chebyshev Series Approximations. <i>SCITECH 2018 - AIAA Science and Technology Forum and Exposition, 28th Space Flight Mechanics Meeting<\/i>, Jan 2018, Kissimmee, United States. pp.1-23, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.2514\/6.2018-1960\">&#x27E8;10.2514\/6.2018-1960&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01540170v3\">&#x27E8;hal-01540170v3&#x27E9;<\/a><\/li><li>Denis Kuperberg, Anirban Majumdar. Width of Non-deterministic Automata. <i>35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)<\/i>, 2018, Caen, France. pp.48 - 49, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.STACS.2018.48\">&#x27E8;10.4230\/LIPIcs.STACS.2018.48&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01891180v1\">&#x27E8;hal-01891180&#x27E9;<\/a><\/li><li>Russ Harmer, Yves-Stan Le Cornec, S\u00e9bastien L\u00e9gar\u00e9, Ievgeniia Oshurko. Bio-curation for cellular signalling. <i>Computational Methods in Systems Biology<\/i>, Sep 2017, Darmstadt, Germany. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-67471-1_1\">&#x27E8;10.1007\/978-3-319-67471-1_1&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01617185v1\">&#x27E8;hal-01617185&#x27E9;<\/a><\/li><li>Anupam Das, Damien Pous. A cut-free cyclic proof system for Kleene algebra. <i>TABLEAUX<\/i>, Sep 2017, Brasilia, Brazil. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01558132v1\">&#x27E8;hal-01558132&#x27E9;<\/a><\/li><li>Paul Brunet, Damien Pous, Georg Struth. On Decidability of Concurrent Kleene Algebra. <i>CONCUR<\/i>, Sep 2017, Berlin, Germany. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01558108v1\">&#x27E8;hal-01558108&#x27E9;<\/a><\/li><li>Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi. Divergence and unique solution of equations. <i>CONCUR 2017 - 28th International Conference on Concurrency Theory<\/i>, Sep 2017, Berlin, Germany. pp.1 - 7, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CONCUR.2017.7\">&#x27E8;10.4230\/LIPIcs.CONCUR.2017.7&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01643502v1\">&#x27E8;hal-01643502&#x27E9;<\/a><\/li><li>C\u00e9cilia Pradic, Colin Riba. A Curry-Howard Approach to Church's Synthesis. <i>FSCD'17<\/i>, Sep 2017, Oxford, United Kingdom. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.FSCD.2017.29\">&#x27E8;10.4230\/LIPIcs.FSCD.2017.29&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01511837v2\">&#x27E8;hal-01511837v2&#x27E9;<\/a><\/li><li>Simon Castellan, Pierre Clairambault, Glynn Winskel. Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or. <i>Second International Conference on Formal Structures for Computation and Deduction, FSCD 2017<\/i>, Sep 2017, Oxford, United Kingdom. pp.1 - 12, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.FSCD.2017.12\">&#x27E8;10.4230\/LIPIcs.FSCD.2017.12&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01886926v1\">&#x27E8;hal-01886926&#x27E9;<\/a><\/li><li>Simon Castellan, Pierre Clairambault, Glynn Winskel. Distributed Strategies Made Easy. <i>42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017<\/i>, Aug 2017, Aalborg, Denmark. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.MFCS.2017.81\">&#x27E8;10.4230\/LIPIcs.MFCS.2017.81&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01886946v1\">&#x27E8;hal-01886946&#x27E9;<\/a><\/li><li>Enric Cosme-Ll\u00f3pez, Damien Pous. K4-free Graphs as a Free Algebra. <i>42nd International Symposium on Mathematical Foundations of Computer Science<\/i>, Aug 2017, Aalborg, Denmark. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01515752v2\">&#x27E8;hal-01515752v2&#x27E9;<\/a><\/li><li>Shaull Almagor, Denis Kuperberg, Orna Kupferman. Sensing as a Complexity Measure. <i>19th International Conference on Descriptional Complexity of Formal Systems (DCFS)<\/i>, Jul 2017, Milano, Italy. pp.3-15, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-60252-3_1\">&#x27E8;10.1007\/978-3-319-60252-3_1&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-01657019v1\">&#x27E8;hal-01657019&#x27E9;<\/a><\/li><li>Matteo Mio, Robert Furber, Radu Mardare. Riesz Modal logic for Markov processes. <i>2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)<\/i>, Jun 2017, Reykjavik, France. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/LICS.2017.8005091\">&#x27E8;10.1109\/LICS.2017.8005091&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01872150v1\">&#x27E8;hal-01872150&#x27E9;<\/a><\/li><li>Henning Basold, Damien Pous, Jurriaan Rot. Monoidal Company for Accessible Functors. <i>CALCO<\/i>, Jun 2017, Ljubljana, Slovenia. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01529340v1\">&#x27E8;hal-01529340&#x27E9;<\/a><\/li><li>Ma\u0142gorzata Biernacka, Dariusz Biernacki, Sergue\u00ef Lenglet, Piotr Polesiuk, Damien Pous, et al.. Fully Abstract Encodings of \u03bb-Calculus in HOcore through Abstract Machines. <i>LICS 2017 - 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science<\/i>, Jun 2017, Reykjavik, Iceland. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/LICS.2017.8005118\">&#x27E8;10.1109\/LICS.2017.8005118&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-01479035v1\">&#x27E8;hal-01479035&#x27E9;<\/a><\/li><li>Damien Pous, Jurriaan Rot. Companions, Codensity and Causality. <i>FoSSaCS<\/i>, Apr 2017, Uppsala, Sweden. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01442222v1\">&#x27E8;hal-01442222&#x27E9;<\/a><\/li><li>Nathana\u00ebl Fijalkow, Hugo Gimbert, Edon Kelmendi, Denis Kuperberg. Stamina: Stabilisation Monoids IN Automata theory. <i>CIAA - International Conference on Implementation and Application of Automata<\/i>, 2017, Marne-la-Vall\u00e9e, France. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01891164v1\">&#x27E8;hal-01891164&#x27E9;<\/a><\/li><li>Patrick Baillot, Anupam Das. Free-cut elimination in linear logic and an application to a feasible arithmetic . <i>Computer Science Logic 2016<\/i>, Aug 2016, Marseille, France. pp. 40:1-40:18, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CSL.2016.40\">&#x27E8;10.4230\/LIPIcs.CSL.2016.40&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01316754v1\">&#x27E8;hal-01316754&#x27E9;<\/a><\/li><li>Simon Castellan, Pierre Clairambault. Causality vs. interleavings in concurrent game semantics. <i>The 27th International Conference on Concurrency Theory (CONCUR 2016)<\/i>, Aug 2016, Qu\u00e9bec City, Canada. pp.1 - 3214, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CONCUR.2016.32\">&#x27E8;10.4230\/LIPIcs.CONCUR.2016.32&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-01474550v1\">&#x27E8;hal-01474550&#x27E9;<\/a><\/li><li>Paul Brunet, Damien Pous, Insa Stucke. Cardinalities of Finite Relations in Coq with Applications. <i>Interative Theorem Proving<\/i>, Aug 2016, Nancy, France. pp.466-474, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-43144-4_29\">&#x27E8;10.1007\/978-3-319-43144-4_29&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01441262v2\">&#x27E8;hal-01441262v2&#x27E9;<\/a><\/li><li>Paul Brunet, Damien Pous. A formal exploration of Nominal Kleene Algebra. <i>MFCS<\/i>, Aug 2016, Cracovie, Poland. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.MFCS.2016.22\">&#x27E8;10.4230\/LIPIcs.MFCS.2016.22&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01307532v2\">&#x27E8;hal-01307532v2&#x27E9;<\/a><\/li><li>Damien Pous. Coinduction All the Way Up. <i>Thirty-First Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2016)<\/i>, Jul 2016, New York, United States. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/2933575.2934564\">&#x27E8;10.1145\/2933575.2934564&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01259622v2\">&#x27E8;hal-01259622v2&#x27E9;<\/a><\/li><li>Olivier Laurent. Focusing in Orthologic. <i>Formal Structures for Computation and Deduction<\/i>, Jun 2016, Porto, Portugal. pp.25, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.FSCD.2016.25\">&#x27E8;10.4230\/LIPIcs.FSCD.2016.25&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01306132v1\">&#x27E8;hal-01306132&#x27E9;<\/a><\/li><li>Laure Daviaud, Denis Kuperberg, Jean-Eric Pin. Varieties of Cost Functions. <i>33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016<\/i>, Feb 2016, Orl\u00e9ans, France. pp.1-30, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.STACS.2016.30\">&#x27E8;10.4230\/LIPIcs.STACS.2016.30&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01614389v1\">&#x27E8;hal-01614389&#x27E9;<\/a><\/li><li>Laure Daviaud, Pierre-Alain Reynier, Jean-Marc Talbot. A Generalized Twinning Property for Minimisation of Cost Register Automata. <i>Proc. 31st Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS'16)<\/i>, 2016, Unknown, Unknown Region. pp.857--866, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/2933575.2934549\">&#x27E8;10.1145\/2933575.2934549&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01475441v1\">&#x27E8;hal-01475441&#x27E9;<\/a><\/li><li>Henryk Michalewski, Matteo Mio. On the Problem of Computing the Probability of Regular Sets of Trees. <i>Proc. of FSTTCS 2015<\/i>, Dec 2015, Bangalore, India. pp.489 - 502, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.FSTTCS.2015.489\">&#x27E8;10.4230\/LIPIcs.FSTTCS.2015.489&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02140487v1\">&#x27E8;hal-02140487&#x27E9;<\/a><\/li><li>Patrick Baillot, Gilles Barthe, Ugo Dal Lago. Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs.. <i>Logic for Programming, Artificial Intelligence, and Reasoning - 20thInternational Conference, LPAR-20<\/i>, Nov 2015, Suva, Fiji. pp.203-218. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01948334v1\">&#x27E8;hal-01948334&#x27E9;<\/a><\/li><li>Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Jean-Claude Reynaud, Damien Pous. Hilbert-Post completeness for the state and the exception effects. <i>Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS 2015)<\/i>, Nov 2015, Berlin, Germany. pp.596-610, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-32859-1_51\">&#x27E8;10.1007\/978-3-319-32859-1_51&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01121924v3\">&#x27E8;hal-01121924v3&#x27E9;<\/a><\/li><li>Adrien Basso-Blandin, Walter Fontana, Russ Harmer. A knowledge representation meta-model for rule-based modelling of signalling networks. <i>DCM<\/i>, Oct 2015, Cali, Colombia. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4204\/EPTCS.204.5\">&#x27E8;10.4204\/EPTCS.204.5&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-01468117v1\">&#x27E8;hal-01468117&#x27E9;<\/a><\/li><li>Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot. Lax Bialgebras and Up-To Techniques for Weak Bisimulations. <i>26th International Conference on Concurrency Theory (CONCUR)<\/i>, Sep 2015, Madrid, Spain. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.CONCUR.2015.240\">&#x27E8;10.4230\/LIPIcs.CONCUR.2015.240&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01285299v1\">&#x27E8;hal-01285299&#x27E9;<\/a><\/li><li>Paul Brunet, Damien Pous. Petri automata for Kleene allegories. <i>Logic in Computer Science<\/i>, Jul 2015, Kyoto, Japan. pp.68-79, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/LICS.2015.17\">&#x27E8;10.1109\/LICS.2015.17&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01073936v3\">&#x27E8;hal-01073936v3&#x27E9;<\/a><\/li><li>Henryk Michalewski, Matteo Mio. Baire Category Quantifier in Monadic Second Order Logic. <i>Proc. of ICALP 2015<\/i>, Jul 2015, Kyoto, Japan. pp.362-374. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02140480v1\">&#x27E8;hal-02140480&#x27E9;<\/a><\/li><li>Simon Castellan, Pierre Clairambault, Glynn Winskel. The Parallel Intensionally Fully Abstract Games Model of PCF. <i>Thirtieth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)<\/i>, Jul 2015, Kyoto, Japan. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/LICS.2015.31\">&#x27E8;10.1109\/LICS.2015.31&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01286477v1\">&#x27E8;hal-01286477&#x27E9;<\/a><\/li><li>Simon Castellan, Pierre Clairambault, Peter Dybjer. Undecidability of Equality in the Free Locally Cartesian Closed Category. <i>TLCA 2015 13th International Conference on Typed Lambda Calculi and Applications<\/i>, Jul 2015, Varsovie, Poland. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.TLCA.2015.138\">&#x27E8;10.4230\/LIPIcs.TLCA.2015.138&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01286479v1\">&#x27E8;hal-01286479&#x27E9;<\/a><\/li><li>Colin Riba. Fibrations of Tree Automata. <i>TLCA 2015<\/i>, Jul 2015, Varsovie, Poland. pp.302--316, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.TLCA.2015.302\">&#x27E8;10.4230\/LIPIcs.TLCA.2015.302&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01261182v1\">&#x27E8;hal-01261182&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Jean-Marie Madiot, Xian Xu. A Behavioural Theory for a \u03c0-calculus with Preorders. <i>6th Fundamentals of Software Engineering (FSEN)<\/i>, Apr 2015, Tehran, Iran. pp.143-158, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-24644-4_10\">&#x27E8;10.1007\/978-3-319-24644-4_10&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-01246094v2\">&#x27E8;hal-01246094v2&#x27E9;<\/a><\/li><li>Pierre Clairambault, Peter Dybjer. Game Semantics and Normalization by Evaluation. <i>18th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS)<\/i>, Apr 2015, Londres, United Kingdom. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-662-46678-0_4\">&#x27E8;10.1007\/978-3-662-46678-0_4&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01286469v1\">&#x27E8;hal-01286469&#x27E9;<\/a><\/li><li>Damien Pous. Coinductive techniques, from automata to coalgebra. <i>Programming Languages Mentoring Workshop<\/i>, Jan 2015, Mumbai, India. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/2792434.2792440\">&#x27E8;10.1145\/2792434.2792440&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01288791v1\">&#x27E8;hal-01288791&#x27E9;<\/a><\/li><li>Damien Pous. Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests. <i>POPL 2015: 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages<\/i>, Jan 2015, Mumbai, India. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01021497v2\">&#x27E8;hal-01021497v2&#x27E9;<\/a><\/li><li>Paul Brunet, Damien Pous. Decidability of Identity-free Relational Kleene Lattices. <i>Vingt-sixi\u00e8mes Journ\u00e9es Francophones des Langages Applicatifs (JFLA 2015)<\/i>, Jan 2015, Le Val d'Ajol, France. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-01099137v1\">&#x27E8;hal-01099137&#x27E9;<\/a><\/li><li>Jean-Marie Madiot, Damien Pous, Davide Sangiorgi. Bisimulations up-to: beyond first-order transition systems. <i>CONCUR<\/i>, Sep 2014, Rome, Italy. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-662-44584-6_8\">&#x27E8;10.1007\/978-3-662-44584-6_8&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00990859v1\">&#x27E8;hal-00990859&#x27E9;<\/a><\/li><li>Simon Castellan, Pierre Clairambault, Glynn Winskel. Symmetry in Concurrent Games. <i>Logic in Computer Science<\/i>, Jul 2014, Vienna, Austria. 10 p. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00990020v1\">&#x27E8;hal-00990020&#x27E9;<\/a><\/li><li>Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot. Coinduction up to in a fibrational setting. <i>CSL-LICS<\/i>, Jul 2014, Vienne, Austria. pp.1-12, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/2603088.2603149\">&#x27E8;10.1145\/2603088.2603149&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00936488v2\">&#x27E8;hal-00936488v2&#x27E9;<\/a><\/li><li>Katarzyna Grygiel, Pierre Lescanne. Counting Terms in the Binary Lambda Calculus. <i>25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms<\/i>, Jun 2014, Paris, France. pp.13. <a target=\"_blank\" href=\"https:\/\/ens-lyon.hal.science\/ensl-00923203v1\">&#x27E8;ensl-00923203&#x27E9;<\/a><\/li><li>Paul Brunet, Damien Pous. Kleene Algebra with Converse. <i>RAMiCS<\/i>, Apr 2014, Marienstatt im Westerwald, Germany. pp.101-118. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00938235v1\">&#x27E8;hal-00938235&#x27E9;<\/a><\/li><li>Matteo Mio. Upper-Expectation Bisimilarity and \u0141ukasiewicz \u03bc-Calculus. <i>Foundations of Software Science and Computation Structures - 17th International Conference, {FOSSACS} 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, {ETAPS} 2014, Grenoble, France, April 5-13, 2014, Proceedings<\/i>, Apr 2014, Grenoble, France. pp.335-350, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-54830-7_22\">&#x27E8;10.1007\/978-3-642-54830-7_22&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02456447v1\">&#x27E8;hal-02456447&#x27E9;<\/a><\/li><li>Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous. Formal verification in Coq of program properties involving the global state effect. <i>JFLA 2014 - Journ\u00e9es Francophones des Langages Applicatifs<\/i>, Jan 2014, Fr\u00e9jus, France. pp.1-17. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00869230v2\">&#x27E8;hal-00869230v2&#x27E9;<\/a><\/li><li>Damien Pous, Alan Schmitt. De la KAM avec un Processus d'Ordre Sup\u00e9rieur. <i>JFLAs 2014<\/i>, Jan 2014, Fr\u00e9jus, France. pp.1-12. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00966097v2\">&#x27E8;hal-00966097v2&#x27E9;<\/a><\/li><li>Pierre Clairambault, Andrzej Murawski. B\u00f6hm trees as higher-order recursion schemes. <i>Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)<\/i>, Dec 2013, Guwahati, India. pp.91--102, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.FSTTCS.2013.91\">&#x27E8;10.4230\/LIPIcs.FSTTCS.2013.91&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00966102v1\">&#x27E8;hal-00966102&#x27E9;<\/a><\/li><li>Filippo Bonchi, Georgiana Caltais, Damien Pous, Alexandra Silva. Brzozowski's and Up-To Algorithms for Must Testing. <i>11th Asian Symposium on Programming Languages and Systems (APLAS)<\/i>, Dec 2013, Melbourne, Australia. pp.1-16, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-03542-0_1\">&#x27E8;10.1007\/978-3-319-03542-0_1&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00966072v1\">&#x27E8;hal-00966072&#x27E9;<\/a><\/li><li>Valentin Blot, Colin Riba. On Bar Recursion and Choice in a Classical Setting. <i>Programming Languages and Systems - 11th Asian Symposium, APLAS 2013<\/i>, Dec 2013, Melbourne, Australia. pp.349-364, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-03542-0_25\">&#x27E8;10.1007\/978-3-319-03542-0_25&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00835540v1\">&#x27E8;hal-00835540&#x27E9;<\/a><\/li><li>Damien Pous. Coalgebraic Up-to Techniques. <i>CALCO<\/i>, Sep 2013, Warsaw, Poland. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-40206-7_4\">&#x27E8;10.1007\/978-3-642-40206-7_4&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00966075v1\">&#x27E8;hal-00966075&#x27E9;<\/a><\/li><li>Matthieu Perrinel. On paths-based criteria for polynomial time complexity in proof-nets. <i>Foundational and Practical Aspects of Resource Analysis (FOPARA) 2013<\/i>, Aug 2013, Bertinoro, Italy. pp.127--142, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-12466-7_8\">&#x27E8;10.1007\/978-3-319-12466-7_8&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00992578v1\">&#x27E8;hal-00992578&#x27E9;<\/a><\/li><li>Damien Pous. Kleene Algebra with Tests and Coq Tools for While Programs. <i>Interactive Theorem Proving 2013<\/i>, Jul 2013, Rennes, France. pp.180-196, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-39634-2_15\">&#x27E8;10.1007\/978-3-642-39634-2_15&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00785969v1\">&#x27E8;hal-00785969&#x27E9;<\/a><\/li><li>Colin Riba. Forcing MSO on Infinite Words in Weak MSO. <i>28th Annual ACM\/IEEE Symposium on Logic in Computer Science<\/i>, Jun 2013, New Orleans, United States. pp.448-457, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/LICS.2013.51\">&#x27E8;10.1109\/LICS.2013.51&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00776921v2\">&#x27E8;hal-00776921v2&#x27E9;<\/a><\/li><li>Fabienne Boyer, Olivier Gruber, Damien Pous. Robust reconfigurations of component assemblies. <i>ICSE '13 - International Conference on Software Engineering<\/i>, May 2013, San Francisco, United States. pp.13-22. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00966078v1\">&#x27E8;hal-00966078&#x27E9;<\/a><\/li><li>Matteo Mio, Alex Simpson. A Proof System for Compositional Verification of Probabilistic Concurrent Processes. <i>Foundations of Software Science and Computation Structures - 16th International Conference (FOSSACS 2013)<\/i>, Mar 2013, Rome, Italy. pp.161-176. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-00766384v1\">&#x27E8;hal-00766384&#x27E9;<\/a><\/li><li>Filippo Bonchi, Damien Pous. Checking NFA equivalence with bisimulations up to congruence. <i>Principle of Programming Languages (POPL)<\/i>, Jan 2013, Roma, Italy. pp.457-468, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/2429069.2429124\">&#x27E8;10.1145\/2429069.2429124&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00639716v5\">&#x27E8;hal-00639716v5&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi. Name-passing calculi: from fusions to preorders and types. <i>LICS - 28th Annual ACM\/IEEE Symposium on Logic in Computer Science - 2013<\/i>, 2013, New Orleans, United States. pp.378-387, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/LICS.2013.44\">&#x27E8;10.1109\/LICS.2013.44&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-00904138v1\">&#x27E8;hal-00904138&#x27E9;<\/a><\/li><li>Vincent Danos, Russ Harmer, Ricardo Honorato-Zimmer. Thermodynamic graph rewriting. <i>Proceedings of CONCUR 2013<\/i>, 2013, Buenos-Aires, Argentina. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01974676v1\">&#x27E8;hal-01974676&#x27E9;<\/a><\/li><li>Colin Riba. A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Streams. <i>7th International Conference on Theoretical Computer Science (TCS)<\/i>, Sep 2012, Amsterdam, Netherlands. pp.310-324, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-33475-7_22\">&#x27E8;10.1007\/978-3-642-33475-7_22&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00692153v1\">&#x27E8;hal-00692153&#x27E9;<\/a><\/li><li>Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi. Termination in impure lambda-calculus. <i>Fundamentals of Software Engineering<\/i>, 2012, Unknown, Afghanistan. pp.128--142. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-00909392v1\">&#x27E8;hal-00909392&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi. Duality and i\/o-Types in the pi-calculus. <i>23rd International Conference on Concurrency Theory (CONCUR 2012)<\/i>, 2012, Newcastle upon Tyne, United Kingdom. pp.302--316, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-32940-1_22\">&#x27E8;10.1007\/978-3-642-32940-1_22&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-00909375v1\">&#x27E8;hal-00909375&#x27E9;<\/a><\/li><li>Thomas Braibant, Damien Pous. Tactics for Reasoning modulo AC in Coq. <i>Certified Proofs and Programs<\/i>, 2011, Taiwan. pp167-182, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-25379-9_14\">&#x27E8;10.1007\/978-3-642-25379-9_14&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00484871v4\">&#x27E8;hal-00484871v4&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Damien Pous. On Bisimilarity and Substitution in Presence of Replication. <i>ICALP<\/i>, Jul 2010, Bordeaux, France. pp.454-465, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-14162-1_38\">&#x27E8;10.1007\/978-3-642-14162-1_38&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00375604v4\">&#x27E8;hal-00375604v4&#x27E9;<\/a><\/li><li>Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi. Termination in Impure Concurrent Languages. <i>CONCUR'10<\/i>, 2010, Paris, France. pp.328-342, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-15375-4_23\">&#x27E8;10.1007\/978-3-642-15375-4_23&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00798789v1\">&#x27E8;hal-00798789&#x27E9;<\/a><\/li><li>Colin Riba. On the Values of Reducibility Candidates. <i>Typed Lambda Calculi and Applications, 9th International Conference, TLCA 2009<\/i>, Jul 2009, Brasilia, Brazil. pp 264-278, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-02273-9_20\">&#x27E8;10.1007\/978-3-642-02273-9_20&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00800668v1\">&#x27E8;hal-00800668&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Aur\u00e9lien Pardon, Tom Hirschowitz, Samuel Hym, Damien Pous. Encapsulation and Dynamic Modularity in the Pi-Calculus. <i>PLACES 2008<\/i>, 2008, Oslo, Norway. pp.85 - 100, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.entcs.2009.06.005\">&#x27E8;10.1016\/j.entcs.2009.06.005&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00400159v1\">&#x27E8;hal-00400159&#x27E9;<\/a><\/li><li>Damien Pous. Complete Lattices and Up-to Techniques. <i>5th Asian Symposium on Programming Languages and Systems<\/i>, Joxan Jaffar, 2007, Singapore, Singapore. pp.351-366, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-540-76637-7_24\">&#x27E8;10.1007\/978-3-540-76637-7_24&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/ens-lyon.hal.science\/ensl-00155308v2\">&#x27E8;ensl-00155308v2&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Damien Pous. A Distribution Law for CCS and a New Congruence Result for the pi-calculus. <i>FoSSaCS<\/i>, 2007, Braga, Portugal. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-540-71389-0_17\">&#x27E8;10.1007\/978-3-540-71389-0_17&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00089219v4\">&#x27E8;hal-00089219v4&#x27E9;<\/a><\/li><li>Damien Pous. On Bisimulation Proofs for the Analysis of Distributed Abstract Machines. <i>TGC<\/i>, 2006, Lucca, Italy. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-540-75336-0_10\">&#x27E8;10.1007\/978-3-540-75336-0_10&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01441457v1\">&#x27E8;hal-01441457&#x27E9;<\/a><\/li><li>Damien Pous. Weak Bisimulation Up to Elaboration. <i>CONCUR<\/i>, 2006, Bonn, Germany. pp.390 - 405, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/11817949_26\">&#x27E8;10.1007\/11817949_26&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01441462v1\">&#x27E8;hal-01441462&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Tom Hirschowitz, Damien Pous, Alan Schmitt, Jean-Bernard Stefani. Component-Oriented Programming with Sharing: Containment is not Ownership. <i>Generative Programming and Component Engineering (GPCE)<\/i>, 2005, Tallinn, Estonia. pp.389-404, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/11561347_26\">&#x27E8;10.1007\/11561347_26&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00310126v1\">&#x27E8;hal-00310126&#x27E9;<\/a><\/li><li>Damien Pous. Up-to Techniques for Weak Bisimulation. <i>ICALP<\/i>, 2005, Lisbonne, Portugal. pp.730 - 741, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/11523468_59\">&#x27E8;10.1007\/11523468_59&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01441463v1\">&#x27E8;hal-01441463&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Damien Pous, Davide Sangiorgi. A Correct Abstract Machine for Safe Ambients. <i>COORDINATION<\/i>, 2005, Namur, Belgium. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/11417019_2\">&#x27E8;10.1007\/11417019_2&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01441466v1\">&#x27E8;hal-01441466&#x27E9;<\/a><\/li><\/ul><\/div><\/div><br><div class=\"grp-div\"><h3 class=\"wphal-titre-groupe\">Poster communications<span class=\"wphal-nbmetadata\" style=\"margin-left:10px\">1 document<\/span><\/h3><div class=\"grp-content\"><ul><li>S\u00e9bastien L\u00e9gar\u00e9, Jean Krivine, Russ Harmer, J\u00e9r\u00f4me Feret. Modelling Systems Biology Wide and Deep. <i>CMSB 2021 - 19th International Conference on Computational Methods in Systems Biology<\/i>, Sep 2021, Bordeaux, France. CMSB. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03357485v1\">&#x27E8;hal-03357485&#x27E9;<\/a><\/li><\/ul><\/div><\/div><br><div class=\"grp-div\"><h3 class=\"wphal-titre-groupe\">Proceedings<span class=\"wphal-nbmetadata\" style=\"margin-left:10px\">1 document<\/span><\/h3><div class=\"grp-content\"><ul><li>Peter H\u00f6fner, Damien Pous, Georg Struth. 16th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS), Proceedings. Peter H\u00f4fner, Damien Pous, Georg Struth. <i>16th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS)<\/i>, 2017, Lyon, France. 10226, Springer, 2017, Proceedings of RAMiCS 2017. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02147353v1\">&#x27E8;hal-02147353&#x27E9;<\/a><\/li><\/ul><\/div><\/div><br><div class=\"grp-div\"><h3 class=\"wphal-titre-groupe\">Special issue<span class=\"wphal-nbmetadata\" style=\"margin-left:10px\">1 document<\/span><\/h3><div class=\"grp-content\"><ul><li>Peter H\u00f6fner, Damien Pous, Georg Struth. Relational and algebraic methods in computer science. <i>Journal of Logical and Algebraic Methods in Programming<\/i>, 106, pp.198-199, 2019, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.jlamp.2019.05.005\">&#x27E8;10.1016\/j.jlamp.2019.05.005&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02331045v1\">&#x27E8;hal-02331045&#x27E9;<\/a><\/li><\/ul><\/div><\/div><br><div class=\"grp-div\"><h3 class=\"wphal-titre-groupe\">Books<span class=\"wphal-nbmetadata\" style=\"margin-left:10px\">3 document<\/span><\/h3><div class=\"grp-content\"><ul><li>Russ Harmer, Ugo Dal Lago (Dir.). Special Issue of EPTCS (vol 179) for DCM 2014. 2015. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02132689v1\">&#x27E8;hal-02132689&#x27E9;<\/a><\/li><li>Ralph Matthes, Matteo Mio (Dir.). Tenth International Workshop on Fixed Points in Computer Science (FICS 2015), Berlin, Allemagne, 11\/09\/2015 - 12\/09\/2015. Matthes, Ralph; Mio, Matteo. Electronic Proceedings in Theoretical Computer Science, 191, 2015, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4204\/EPTCS.191\">&#x27E8;10.4204\/EPTCS.191&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03198240v1\">&#x27E8;hal-03198240&#x27E9;<\/a><\/li><li>Thomas Ehrhard, Claudia Faggian, Olivier Laurent (Dir.). Girard's Festschrift, Theoretical Computer Science (Volume 412, Issue 20). Elsevier, pp.240, 2011. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00589711v1\">&#x27E8;hal-00589711&#x27E9;<\/a><\/li><\/ul><\/div><\/div><br><div class=\"grp-div\"><h3 class=\"wphal-titre-groupe\">Book sections<span class=\"wphal-nbmetadata\" style=\"margin-left:10px\">3 document<\/span><\/h3><div class=\"grp-content\"><ul><li>Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi. Proof Techniques for\u00a0Behavioural Relations Based on\u00a0Unique-Solutions of\u00a0Equations and\u00a0Inequations. Edward A. Lee; Mohammad Reza Mousavi; Carolyn Talcott. <i>Rebeca for Actor Analysis in Action: Essays Dedicated to Marjan Sirjani on the Occasion of Her 60th Birthday<\/i>, LNCS-15560, Springer Nature Switzerland, pp.425-439, 2025, Lecture Notes in Computer Science, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-85134-6_19\">&#x27E8;10.1007\/978-3-031-85134-6_19&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05371648v1\">&#x27E8;hal-05371648&#x27E9;<\/a><\/li><li>Pierre Clairambault, Simon Castellan, Peter Dybjer. Categories with Families: Unityped, Simply Typed, and Dependently Typed. <i>Joachim Lambek: The Interplay of Mathematics, Logic, and Linguistics<\/i>, 20, Springer International Publishing, pp.135-180, 2021, Outstanding Contributions to Logic, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-66545-6_5\">&#x27E8;10.1007\/978-3-030-66545-6_5&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03419296v1\">&#x27E8;hal-03419296&#x27E9;<\/a><\/li><li>Damien Pous, Davide Sangiorgi. Enhancements of the bisimulation proof method. Davide Sangiorgi and Jan Rutten. <i>Advanced Topics in Bisimulation and Coinduction<\/i>, Cambridge University Press, 2012. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-00909391v1\">&#x27E8;hal-00909391&#x27E9;<\/a><\/li><\/ul><\/div><\/div><br><div class=\"grp-div\"><h3 class=\"wphal-titre-groupe\">Preprints, Working Papers<span class=\"wphal-nbmetadata\" style=\"margin-left:10px\">25 document<\/span><\/h3><div class=\"grp-content\"><ul><li>Kazuhiko Sakaguchi. Tactics modulo associativity and cancellation for category theory. 2026. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05521070v1\">&#x27E8;hal-05521070&#x27E9;<\/a><\/li><li>Silvia Ghilezan, Jelena Iveti\u0107, Pierre Lescanne, Simona Ka\u0161terovi\u0107. List types for resource aware languages: an implicit name approach. 2026. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03498420v3\">&#x27E8;hal-03498420v3&#x27E9;<\/a><\/li><li>Samuel Humeau, Damien Pous. On the Two Paths Theorem and the Two Disjoint Paths Problem. 2025. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05077563v2\">&#x27E8;hal-05077563v2&#x27E9;<\/a><\/li><li>Luca Reggio, Colin Riba. Finitely accessible arboreal adjunctions and Hintikka formulae. 2024. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04856527v1\">&#x27E8;hal-04856527&#x27E9;<\/a><\/li><li>Emile Hazard, Olivier Idir, Denis Kuperberg. Explorable Parity Automata. 2024. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04774282v1\">&#x27E8;hal-04774282&#x27E9;<\/a><\/li><li>Thomas Colcombet, Amina Doumane, Denis Kuperberg. Tree algebras and bisimulation-invariant MSO on finite graphs. 2024. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04729207v1\">&#x27E8;hal-04729207&#x27E9;<\/a><\/li><li>Enguerrand Prebet. On Up-to Context Techniques in the \u03c0-calculus. 2022. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03482459v2\">&#x27E8;hal-03482459v2&#x27E9;<\/a><\/li><li>Pierre Lescanne. Almost all classical theorems are intuitionistic. 2022. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03197423v6\">&#x27E8;hal-03197423v6&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Enguerrand Prebet, Davide Sangiorgi. On sequentiality and well-bracketing in the \u03c0-calculus (Long Version). 2021. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03478052v1\">&#x27E8;hal-03478052&#x27E9;<\/a><\/li><li>Marion Cr\u00e9hange, Pierre Lescanne, Alain Qu\u00e9r\u00e9. L'informatique de Claude Pair. 2021. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03193950v2\">&#x27E8;hal-03193950v2&#x27E9;<\/a><\/li><li>Guilhem Jaber, Colin Riba. Temporal Refinements for Guarded Recursive Types (full version). 2021. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02512655v5\">&#x27E8;hal-02512655v5&#x27E9;<\/a><\/li><li>Anupam Das, Colin Riba. A functional (Monadic) second-order theory of infinite trees. 2020. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02067267v2\">&#x27E8;hal-02067267v2&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Enguerrand Prebet, Davide Sangiorgi. On the Representation of References in the pi-calculus. 2020. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02895654v2\">&#x27E8;hal-02895654v2&#x27E9;<\/a><\/li><li>Pierre Lescanne. Extensive Infinite Games and Escalation, an exercice in Agda. 2020. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02874762v1\">&#x27E8;hal-02874762&#x27E9;<\/a><\/li><li>Pierre Clairambault. Learning to Count up to Symmetry. 2020. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02861005v1\">&#x27E8;hal-02861005&#x27E9;<\/a><\/li><li>Patrick Baillot, Alexis Ghyselen. Types for Parallel Complexity in the Pi-calculus. 2019. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02302544v1\">&#x27E8;hal-02302544&#x27E9;<\/a><\/li><li>Christian Doczkal, Damien Pous. Graph Theory in Coq: Minors, Treewidth, and Isomorphisms. 2019. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02127698v1\">&#x27E8;hal-02127698&#x27E9;<\/a><\/li><li>Christian Doczkal. Short proof of Menger's Theorem in Coq (Proof Pearl). 2019. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02086931v1\">&#x27E8;hal-02086931&#x27E9;<\/a><\/li><li>Florent Br\u00e9hard, Nicolas Brisebarre, Mioara Joldes, Warwick Tucker. A New Lower Bound on the Hilbert Number for Quartic Systems. 2019. <a target=\"_blank\" href=\"https:\/\/laas.hal.science\/hal-02085895v1\">&#x27E8;hal-02085895&#x27E9;<\/a><\/li><li>Colin Riba. Monoidal-Closed Categories of Tree Automata. 2018. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01261183v10\">&#x27E8;hal-01261183v10&#x27E9;<\/a><\/li><li>Colin Riba, Guilhem Jaber. Modal Logic of Transition Systems in the Topos of Trees. 2017. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01620992v1\">&#x27E8;hal-01620992&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Jean-Marie Madiot, Xian Xu. A behavioural theory for a \u03c0-calculus with preorders. 2014. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00949521v1\">&#x27E8;hal-00949521&#x27E9;<\/a><\/li><li>Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi. Name-passing calculi: from fusions to preorders and types. 2013. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-00818068v2\">&#x27E8;hal-00818068v2&#x27E9;<\/a><\/li><li>Katarzyna Grygiel, Pierre Lescanne. Counting and generating lambda terms. 2012. <a target=\"_blank\" href=\"https:\/\/ens-lyon.hal.science\/ensl-00740034v7\">&#x27E8;ensl-00740034v7&#x27E9;<\/a><\/li><li>Colin Riba. On the Representation of Stream Functions in Denotational Domains. 2011. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00617624v1\">&#x27E8;hal-00617624&#x27E9;<\/a><\/li><\/ul><\/div><\/div><br><div class=\"grp-div\"><h3 class=\"wphal-titre-groupe\">Reports<span class=\"wphal-nbmetadata\" style=\"margin-left:10px\">3 document<\/span><\/h3><div class=\"grp-content\"><ul><li>Hubert Comon, Simon Perdrix, Pierre Aboulker, Pablo Arrighi, Sandrine Blazy, et al.. Section 06\r\nSciences de l\u2019information\u2009: fondements de l\u2019informatique, calculs, algorithmes, repr\u00e9sentations, exploitations. CNRS. 2021. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-04884956v1\">&#x27E8;hal-04884956&#x27E9;<\/a><\/li><li>Ma\u0142gorzata Biernacka, Dariusz Biernacki, Sergue\u00ef Lenglet, Piotr Polesiuk, Damien Pous, et al.. Fully Abstract Encodings of \u03bb-Calculus in HOcore through Abstract Machines. [Research Report] RR-9052, Inria. 2017. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-01507625v1\">&#x27E8;hal-01507625&#x27E9;<\/a><\/li><li>Paul Brunet, Damien Pous. Decidability of Identity-free Relational Kleene Lattices. [Research Report] ENS de Lyon. 2014. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01073932v1\">&#x27E8;hal-01073932&#x27E9;<\/a><\/li><\/ul><\/div><\/div><br><div class=\"grp-div\"><h3 class=\"wphal-titre-groupe\">Theses<span class=\"wphal-nbmetadata\" style=\"margin-left:10px\">14 document<\/span><\/h3><div class=\"grp-content\"><ul><li>R\u00e9mi Di Guardia. Identity of Proofs and Formulas using Proof-Nets in Multiplicative-Additive Linear Logic. Computer Science [cs]. Ecole normale sup\u00e9rieure de lyon - ENS LYON, 2024. English. <a target=\"_blank\" href=\"https:\/\/www.theses.fr\/2024ENSL0050\">&#x27E8;NNT : 2024ENSL0050&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/theses.hal.science\/tel-04830060v1\">&#x27E8;tel-04830060&#x27E9;<\/a><\/li><li>Ralph Sarkis. Lifting Algebraic Reasoning to Generalized Metric Spaces. Logic in Computer Science [cs.LO]. Ecole normale sup\u00e9rieure de lyon - ENS LYON, 2024. English. <a target=\"_blank\" href=\"https:\/\/www.theses.fr\/2024ENSL0025\">&#x27E8;NNT : 2024ENSL0025&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/theses.hal.science\/tel-04717268v1\">&#x27E8;tel-04717268&#x27E9;<\/a><\/li><li>\u00c9mile Hazard. Non-determinism, explorable automata and cyclic proofs. Computational Complexity [cs.CC]. Ecole normale sup\u00e9rieure de lyon - ENS LYON, 2022. English. <a target=\"_blank\" href=\"https:\/\/www.theses.fr\/2022ENSL0022\">&#x27E8;NNT : 2022ENSL0022&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/theses.hal.science\/tel-03969156v1\">&#x27E8;tel-03969156&#x27E9;<\/a><\/li><li>Enguerrand Prebet. Typed Behavioural Equivalences in the Pi-Calculus. Logic in Computer Science [cs.LO]. Ecole normale sup\u00e9rieure de lyon - ENS LYON; Universit\u00e0 degli studi (Bologne, Italie), 2022. English. <a target=\"_blank\" href=\"https:\/\/www.theses.fr\/2022ENSL0017\">&#x27E8;NNT : 2022ENSL0017&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/tel-03920089v2\">&#x27E8;tel-03920089v2&#x27E9;<\/a><\/li><li>Christophe Lucas. Proof Theory of Riesz Modal Logic. General Mathematics [math.GM]. Ecole normale sup\u00e9rieure de lyon - ENS LYON, 2022. English. <a target=\"_blank\" href=\"https:\/\/www.theses.fr\/2022ENSL0009\">&#x27E8;NNT : 2022ENSL0009&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/theses.hal.science\/tel-03886259v1\">&#x27E8;tel-03886259&#x27E9;<\/a><\/li><li>Alexis Ghyselen. Sized Types Methods and their Applications to Complexity Analysis in Pi-Calculus. Computational Complexity [cs.CC]. Universit\u00e9 de Lyon, 2021. English. <a target=\"_blank\" href=\"https:\/\/www.theses.fr\/2021LYSEN036\">&#x27E8;NNT : 2021LYSEN036&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/theses.hal.science\/tel-03405961v1\">&#x27E8;tel-03405961&#x27E9;<\/a><\/li><li>Laureline Pinault. From automata to cyclic proofs : equivalence algorithms and descriptive complexity. Logic in Computer Science [cs.LO]. Universit\u00e9 de Lyon, 2021. English. <a target=\"_blank\" href=\"https:\/\/www.theses.fr\/2021LYSEN024\">&#x27E8;NNT : 2021LYSEN024&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/theses.hal.science\/tel-03412556v1\">&#x27E8;tel-03412556&#x27E9;<\/a><\/li><li>Marc de Visme. Quantum Game Semantics. Logic in Computer Science [cs.LO]. Universit\u00e9 de Lyon, 2020. English. <a target=\"_blank\" href=\"https:\/\/www.theses.fr\/2020LYSEN056\">&#x27E8;NNT : 2020LYSEN056&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/theses.hal.science\/tel-03045844v1\">&#x27E8;tel-03045844&#x27E9;<\/a><\/li><li>Ievgeniia Oshurko. Knowledge representation and curation in hierarchies of graphs. Artificial Intelligence [cs.AI]. Universit\u00e9 de Lyon, 2020. English. <a target=\"_blank\" href=\"https:\/\/www.theses.fr\/2020LYSEN024\">&#x27E8;NNT : 2020LYSEN024&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/theses.hal.science\/tel-02917559v1\">&#x27E8;tel-02917559&#x27E9;<\/a><\/li><li>Adrien Durier. Unique solution techniques for processes and functions. Programming Languages [cs.PL]. Universit\u00e9 de Lyon; Universit\u00e0 degli studi (Bologne, Italie), 2020. English. <a target=\"_blank\" href=\"https:\/\/www.theses.fr\/2020LYSEN016\">&#x27E8;NNT : 2020LYSEN016&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/theses.hal.science\/tel-02947048v1\">&#x27E8;tel-02947048&#x27E9;<\/a><\/li><li>Aurore Alcolei. Enriched concurrent games : witnesses for proofs and resource analysis. Logic in Computer Science [cs.LO]. Universit\u00e9 de Lyon; University of Cambridge, 2019. English. <a target=\"_blank\" href=\"https:\/\/www.theses.fr\/2019LYSEN054\">&#x27E8;NNT : 2019LYSEN054&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/theses.hal.science\/tel-02448974v1\">&#x27E8;tel-02448974&#x27E9;<\/a><\/li><li>Simon Castellan. Concurrent structures in game semantics. Logic in Computer Science [cs.LO]. Universit\u00e9 de Lyon, 2017. English. <a target=\"_blank\" href=\"https:\/\/www.theses.fr\/2017LYSEN034\">&#x27E8;NNT : 2017LYSEN034&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/theses.hal.science\/tel-01587718v1\">&#x27E8;tel-01587718&#x27E9;<\/a><\/li><li>Athanasios Tsouanas. On the Semantics of Disjunctive Logic Programs. Logic in Computer Science [cs.LO]. Ecole Nationale Sup\u00e9rieure de Lyon, 2014. English. <a target=\"_blank\" href=\"https:\/\/www.theses.fr\/\">&#x27E8;NNT : &#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/theses.hal.science\/tel-02139060v1\">&#x27E8;tel-02139060&#x27E9;<\/a><\/li><li>Damien Pous. Techniques modulo pour les bisimulations. Informatique [cs]. ENS Lyon, 2008. Fran\u00e7ais. <a target=\"_blank\" href=\"https:\/\/www.theses.fr\/\">&#x27E8;NNT : &#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/tel-01441480v1\">&#x27E8;tel-01441480&#x27E9;<\/a><\/li><\/ul><\/div><\/div><br><div class=\"grp-div\"><h3 class=\"wphal-titre-groupe\">HDR thesis<span class=\"wphal-nbmetadata\" style=\"margin-left:10px\">5 document<\/span><\/h3><div class=\"grp-content\"><ul><li>Matteo Mio. Recent Results on Quantitative Equational Logic. Computer Science [cs]. Ecole normale sup\u00e9rieure de Lyon, 2024. <a target=\"_blank\" href=\"https:\/\/hal.science\/tel-04840941v1\">&#x27E8;tel-04840941&#x27E9;<\/a><\/li><li>Colin Riba. Toward Curry-Howard Approaches to MSO and Automata on Infinite Words and Trees. Computer Science [cs]. ENS de Lyon, 2019. <a target=\"_blank\" href=\"https:\/\/hal.science\/tel-04856525v1\">&#x27E8;tel-04856525&#x27E9;<\/a><\/li><li>Russell Harmer. Rule-based meta-modelling for bio-curation. Bioinformatics [q-bio.QM]. Ecole Normale Sup\u00e9rieure de Lyon, 2017. <a target=\"_blank\" href=\"https:\/\/hal.science\/tel-01534703v1\">&#x27E8;tel-01534703&#x27E9;<\/a><\/li><li>Damien Pous. Automata for relation algebra and formal proofs. Computer Science [cs]. ENS Lyon, 2016. <a target=\"_blank\" href=\"https:\/\/hal.science\/tel-01445821v1\">&#x27E8;tel-01445821&#x27E9;<\/a><\/li><li>Olivier Laurent. Investigations classiques, complexes et concurrentes \u00e0 l'aide de la logique lin\u00e9aire. Math\u00e9matiques [math]. Universit\u00e9 Paris-Diderot - Paris VII, 2010. <a target=\"_blank\" href=\"https:\/\/theses.hal.science\/tel-00460805v1\">&#x27E8;tel-00460805&#x27E9;<\/a><\/li><\/ul><\/div><\/div><br><div class=\"grp-div\"><h3 class=\"wphal-titre-groupe\">Logiciel<span class=\"wphal-nbmetadata\" style=\"margin-left:10px\">21 document<\/span><\/h3><div class=\"grp-content\"><ul><li>Olivier Laurent. YALLA: Yet Another deep embedding of Linear Logic in Rocq. 2025, <a target=\"_blank\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:2e43a1ba10c4f11ed8d8f4cc22f4106a48f1d007\">&#x27E8;swh:1:dir:2e43a1ba10c4f11ed8d8f4cc22f4106a48f1d007&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05015660v1\">&#x27E8;hal-05015660&#x27E9;<\/a><\/li><li>Olivier Laurent. Quantifiers. 2025, <a target=\"_blank\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:48009bbccf91ce1ba3238f8a34d57ddb5f7e9786\">&#x27E8;swh:1:dir:48009bbccf91ce1ba3238f8a34d57ddb5f7e9786&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05015760v1\">&#x27E8;hal-05015760&#x27E9;<\/a><\/li><li>R\u00e9mi Di Guardia, Olivier Laurent. Proof nets for MLL. 2025, <a target=\"_blank\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:a5e052a812cc72ef6b32f0cbb455ce2d8b315f71\">&#x27E8;swh:1:dir:a5e052a812cc72ef6b32f0cbb455ce2d8b315f71&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05015800v1\">&#x27E8;hal-05015800&#x27E9;<\/a><\/li><li>Christophe Lucas, Olivier Laurent. List Permutation. 2025, <a target=\"_blank\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:dab64b85cec398e0f7712ef7205b8f32d0b9d5d8\">&#x27E8;swh:1:dir:dab64b85cec398e0f7712ef7205b8f32d0b9d5d8&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05015776v1\">&#x27E8;hal-05015776&#x27E9;<\/a><\/li><li>Olivier Laurent. FormalizedLLBib. 2025, <a target=\"_blank\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:56ebe157fe0d55ff61383a66b3189e2cde6c8c00\">&#x27E8;swh:1:dir:56ebe157fe0d55ff61383a66b3189e2cde6c8c00&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05015747v1\">&#x27E8;hal-05015747&#x27E9;<\/a><\/li><li>Reynald Affeldt, Yves Bertot, Alessandro Bruni, Cyril Cohen, Marie Kerjean, et al.. Mathematical Components Analysis. 2025, <a target=\"_blank\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:5fe4b61acc38fea6066881d466ac64524e90a4cd\">&#x27E8;swh:1:dir:5fe4b61acc38fea6066881d466ac64524e90a4cd&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-05038721v1\">&#x27E8;hal-05038721&#x27E9;<\/a><\/li><li>Denis Kuperberg, Thomas Kosc. EmergeNS. 2025, <a target=\"_blank\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:5f8cf6188f4b80882b49e4024c42a679c324d1f2;origin=https:\/\/github.com\/deniskup\/EmergeNS;visit=swh:1:snp:71ce660310840624e246b38e8ca30b03db6f3b2b;anchor=swh:1:rev:f24da194ab1c42fdf7cd4e3077006874f3d13b6f\">&#x27E8;swh:1:dir:5f8cf6188f4b80882b49e4024c42a679c324d1f2;origin=https:\/\/github.com\/deniskup\/EmergeNS;visit=swh:1:snp:71ce660310840624e246b38e8ca30b03db6f3b2b;anchor=swh:1:rev:f24da194ab1c42fdf7cd4e3077006874f3d13b6f&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05022958v1\">&#x27E8;hal-05022958&#x27E9;<\/a><\/li><li>Cyril Cohen, Pierre Roux, Kazuhiko Sakaguchi, Enrico Tassi. Hierarchy Builder. 2025, <a target=\"_blank\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:50c5087fc42a2f95913dada99ef4ac1cdba66d7b\">&#x27E8;swh:1:dir:50c5087fc42a2f95913dada99ef4ac1cdba66d7b&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/inria.hal.science\/hal-05038713v1\">&#x27E8;hal-05038713&#x27E9;<\/a><\/li><li>Olivier Laurent, Christophe Lucas. OLlibs - Add-ons for the Rocq Standard Library. 2025, <a target=\"_blank\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:d2917e29b501a71bf5a507f950d07b20913b7dd5\">&#x27E8;swh:1:dir:d2917e29b501a71bf5a507f950d07b20913b7dd5&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05015741v1\">&#x27E8;hal-05015741&#x27E9;<\/a><\/li><li>Russ Harmer, Eugenia Oshurko. KAMI. 2025. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05008503v1\">&#x27E8;hal-05008503&#x27E9;<\/a><\/li><li>Russ Harmer, Eugenia Oshurko. ReGraph. 2025. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05008491v1\">&#x27E8;hal-05008491&#x27E9;<\/a><\/li><li>Etienne Callies, Olivier Laurent. Click and coLLecT - An Interactive Linear Logic Prover. 2025, <a target=\"_blank\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:d17c7c89c9873b38f35ac4fc7f38d8223b239eaf\">&#x27E8;swh:1:dir:d17c7c89c9873b38f35ac4fc7f38d8223b239eaf&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05015678v1\">&#x27E8;hal-05015678&#x27E9;<\/a><\/li><li>Damien Pous. Hypergraphs. 2024, <a target=\"_blank\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:da2a8407423406fdf9245865182978f4987c53ba;origin=https:\/\/github.com\/damien-pous\/hypergraph;visit=swh:1:snp:3525f0e39473f1c5a1a89db0d76cdb4e1494de3a;anchor=swh:1:rev:cd81a1c98f658ddbf4c3e6cd292006411c3a66fe\">&#x27E8;swh:1:dir:da2a8407423406fdf9245865182978f4987c53ba;origin=https:\/\/github.com\/damien-pous\/hypergraph;visit=swh:1:snp:3525f0e39473f1c5a1a89db0d76cdb4e1494de3a;anchor=swh:1:rev:cd81a1c98f658ddbf4c3e6cd292006411c3a66fe&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05007264v1\">&#x27E8;hal-05007264&#x27E9;<\/a><\/li><li>Matteo Mio, Christophe Lucas. Coq implementation of the main results of the LMCS article:\r\nMatteo Mio, Christophe Lucas, \"Proof Theory of Riesz Spaces and Modal Riesz Spaces\" (https:\/\/arxiv.org\/abs\/2004.11185), Logical Methods in Computer Science, 2020.. 2021, <a target=\"_blank\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:f6b278011f328518cea6df25be7d7fae0dd1368e;origin=https:\/\/github.com\/clucas26e4\/Proof-Theory-of-Riesz-Spaces-and-Modal-Riesz-Spaces;visit=swh:1:snp:52b90c3fed877652e441ab004b08a5c776f65d45;anchor=swh:1:rev:0fab763d9838c2c40a438fea2a41f0ae9debbddc\">&#x27E8;swh:1:dir:f6b278011f328518cea6df25be7d7fae0dd1368e;origin=https:\/\/github.com\/clucas26e4\/Proof-Theory-of-Riesz-Spaces-and-Modal-Riesz-Spaces;visit=swh:1:snp:52b90c3fed877652e441ab004b08a5c776f65d45;anchor=swh:1:rev:0fab763d9838c2c40a438fea2a41f0ae9debbddc&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05022699v1\">&#x27E8;hal-05022699&#x27E9;<\/a><\/li><li>Christian Doczkal, Damien Pous. Graph Theory in Rocq. 2019, <a target=\"_blank\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:704919fed5f407972dd1087cbe0f5950aa9e07c7;origin=https:\/\/github.com\/rocq-community\/graph-theory;visit=swh:1:snp:fcf1fe871ca8c8ccd680b31fbcfeb9f6f3413a4b;anchor=swh:1:rev:82376417471e50319511ab86c3a0a912d30c2408\">&#x27E8;swh:1:dir:704919fed5f407972dd1087cbe0f5950aa9e07c7;origin=https:\/\/github.com\/rocq-community\/graph-theory;visit=swh:1:snp:fcf1fe871ca8c8ccd680b31fbcfeb9f6f3413a4b;anchor=swh:1:rev:82376417471e50319511ab86c3a0a912d30c2408&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05007235v1\">&#x27E8;hal-05007235&#x27E9;<\/a><\/li><li>Damien Pous, Florent Br\u00e9hard, Louis Gaillard, Assia Mahboubi. Certified Chebyshev models  in Rocq. 2019, <a target=\"_blank\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:6cdde290b1103523b5da14286df67b8df99b14a4;origin=https:\/\/github.com\/damien-pous\/approx-models;visit=swh:1:snp:0b56d5fef783663a395578bc5fb64f9f8afa0342;anchor=swh:1:rev:2304ba7730fbb293d4cb55f609994d7bdaf4e83f\">&#x27E8;swh:1:dir:6cdde290b1103523b5da14286df67b8df99b14a4;origin=https:\/\/github.com\/damien-pous\/approx-models;visit=swh:1:snp:0b56d5fef783663a395578bc5fb64f9f8afa0342;anchor=swh:1:rev:2304ba7730fbb293d4cb55f609994d7bdaf4e83f&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05008009v1\">&#x27E8;hal-05008009&#x27E9;<\/a><\/li><li>Damien Pous. Coinduction for Rocq. 2016, <a target=\"_blank\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:60354e7c6f1de3c6fb6f9802bc51388389e595c7;origin=https:\/\/github.com\/damien-pous\/coinduction;visit=swh:1:snp:4bea1f2a79556640b9efa975f8ddcd40056da2ed;anchor=swh:1:rev:823b424778feff8fbd9759bc3a044435ea4902d1\">&#x27E8;swh:1:dir:60354e7c6f1de3c6fb6f9802bc51388389e595c7;origin=https:\/\/github.com\/damien-pous\/coinduction;visit=swh:1:snp:4bea1f2a79556640b9efa975f8ddcd40056da2ed;anchor=swh:1:rev:823b424778feff8fbd9759bc3a044435ea4902d1&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05007399v1\">&#x27E8;hal-05007399&#x27E9;<\/a><\/li><li>Damien Pous. SAFA: Symbolic Algorithms for Finite Automata. 2015, <a target=\"_blank\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:5f1e86a3d4cc494f4770536f6a488b198a4ea26b;origin=https:\/\/github.com\/damien-pous\/safa;visit=swh:1:snp:6d73be34ea9df77ea2f162e706870d505220823f;anchor=swh:1:rev:4c1b478b10864c4b8a6de4457816f4861f3b131d\">&#x27E8;swh:1:dir:5f1e86a3d4cc494f4770536f6a488b198a4ea26b;origin=https:\/\/github.com\/damien-pous\/safa;visit=swh:1:snp:6d73be34ea9df77ea2f162e706870d505220823f;anchor=swh:1:rev:4c1b478b10864c4b8a6de4457816f4861f3b131d&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05007633v1\">&#x27E8;hal-05007633&#x27E9;<\/a><\/li><li>Damien Pous. SymKAT: Symbolic Algorithms for Kleene algebra with Tests (KAT). 2014, <a target=\"_blank\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:438007062016994a4be44c7ab67d2aafe667d166;origin=https:\/\/github.com\/damien-pous\/symkat;visit=swh:1:snp:d190ce756c596d30ae43ada19de0ab83566e7bcc;anchor=swh:1:rev:4c7bc8877bc85e7a368cc430067f0d291706ac17\">&#x27E8;swh:1:dir:438007062016994a4be44c7ab67d2aafe667d166;origin=https:\/\/github.com\/damien-pous\/symkat;visit=swh:1:snp:d190ce756c596d30ae43ada19de0ab83566e7bcc;anchor=swh:1:rev:4c7bc8877bc85e7a368cc430067f0d291706ac17&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05007635v1\">&#x27E8;hal-05007635&#x27E9;<\/a><\/li><li>Damien Pous. Relation algebra and Kleene algebra in Rocq. 2012, <a target=\"_blank\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:c9561374fb8aab89048b993ac68715b765262c13;origin=https:\/\/github.com\/damien-pous\/relation-algebra;visit=swh:1:snp:1a29f5f9a0d4688ceb46cc789085969f29d710c9;anchor=swh:1:rev:b8b932d33e24d2db5b3360e7ec442b8092a22303\">&#x27E8;swh:1:dir:c9561374fb8aab89048b993ac68715b765262c13;origin=https:\/\/github.com\/damien-pous\/relation-algebra;visit=swh:1:snp:1a29f5f9a0d4688ceb46cc789085969f29d710c9;anchor=swh:1:rev:b8b932d33e24d2db5b3360e7ec442b8092a22303&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05007316v1\">&#x27E8;hal-05007316&#x27E9;<\/a><\/li><li>Damien Pous, Thomas Braibant, Fabian Kunze, Karl Palmskog. AAC-Tactics for Rocq. 2010, <a target=\"_blank\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:d5d22e1835baf1009970a827b49c9733ecbf5ce9;origin=https:\/\/github.com\/rocq-community\/aac-tactics;visit=swh:1:snp:d2c66d06f723377571f45280977c7697d38053cf;anchor=swh:1:rev:7a7f4a61fa5830f5a3170ca62b13b3fed6d546ab\">&#x27E8;swh:1:dir:d5d22e1835baf1009970a827b49c9733ecbf5ce9;origin=https:\/\/github.com\/rocq-community\/aac-tactics;visit=swh:1:snp:d2c66d06f723377571f45280977c7697d38053cf;anchor=swh:1:rev:7a7f4a61fa5830f5a3170ca62b13b3fed6d546ab&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05007361v1\">&#x27E8;hal-05007361&#x27E9;<\/a><\/li><\/ul><\/div><\/div><br><\/div>\n    <\/div>\n<\/div><div class=\"wphal-footer\"><p style=\"color:#B3B2B0\">Powered by HAL&nbsp;<a href=\"https:\/\/hal.science\/\" target=\"_blank\"><img decoding=\"async\" alt=\"logo\" src=\"https:\/\/www.ens-lyon.fr\/LIP\/PLUME\/wp-content\/plugins\/hal\/img\/logo-hal.png\" style=\"width:90px\"><\/a><\/p><\/div><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-949","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.ens-lyon.fr\/LIP\/PLUME\/wp-json\/wp\/v2\/pages\/949","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.ens-lyon.fr\/LIP\/PLUME\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.ens-lyon.fr\/LIP\/PLUME\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.ens-lyon.fr\/LIP\/PLUME\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.ens-lyon.fr\/LIP\/PLUME\/wp-json\/wp\/v2\/comments?post=949"}],"version-history":[{"count":6,"href":"https:\/\/www.ens-lyon.fr\/LIP\/PLUME\/wp-json\/wp\/v2\/pages\/949\/revisions"}],"predecessor-version":[{"id":1215,"href":"https:\/\/www.ens-lyon.fr\/LIP\/PLUME\/wp-json\/wp\/v2\/pages\/949\/revisions\/1215"}],"wp:attachment":[{"href":"https:\/\/www.ens-lyon.fr\/LIP\/PLUME\/wp-json\/wp\/v2\/media?parent=949"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}