{"id":13,"date":"2015-06-15T10:26:53","date_gmt":"2015-06-15T08:26:53","guid":{"rendered":"http:\/\/members.loria.fr\/thierrygartiser\/?page_id=13"},"modified":"2026-03-01T23:28:58","modified_gmt":"2026-03-01T21:28:58","slug":"publications","status":"publish","type":"page","link":"https:\/\/members.loria.fr\/RPechoux\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"<p>   <!DOCTYPE html PUBLIC \"-\/\/W3C\/\/DTD XHTML 1.0 Transitional\/\/EN\" \"http:\/\/www.w3.org\/TR\/xhtml1\/DTD\/xhtml1-transitional.dtd\"> <html xmlns='http:\/\/www.w3.org\/1999\/xhtml' xml:lang='fr' lang='fr'> <head> <meta name=\"robots\" content=\"noindex, nofollow\" \/> <meta http-equiv=\"content-type\" content= \"text\/html;charset=UTF-8\" \/> <meta http-equiv=\"Content-Language\" content=\"fr\" \/> <link rel=\"stylesheet\" type=\"text\/css\" href=\"..\/css\/VisuGen.css\" \/> <link rel=\"stylesheet\" type=\"text\/css\" href=\"https:\/\/haltools.inria.fr\/\/css\/VisuRubriqueEncadre.css\" \/> <!-- Piwik haltools.inria.fr--> <script type=\"text\/javascript\">   var _paq = _paq || [];   _paq.push(['trackPageView']);   _paq.push(['enableLinkTracking']);   (function() {     var u=\"\/\/piwik.inria.fr\/\";     _paq.push(['setTrackerUrl', u+'piwik.php']);     _paq.push(['setSiteId', 25]);     var d=document, g=d.createElement('script'), s=d.getElementsByTagName('script')[0];     g.type='text\/javascript'; g.async=true; g.defer=true; g.src=u+'piwik.js'; s.parentNode.insertBefore(g,s);   })(); <\/script> <noscript><\/p>\n<p><img decoding=\"async\" src=\"\/\/piwik.inria.fr\/piwik.php?idsite=25\" style=\"border:0;\" alt=\"\" \/><\/p>\n<p><\/noscript> <!-- End Piwik Code -->  <title>Publications HAL de  romain p\u00e9choux<\/title> <\/head> <body> <\/p>\n<div id=\"res_script\">\n<p class='Rubrique'>2026<\/p>\n<p class='SousRubrique'>Preprints, Working Papers, &#8230;<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-05538043v1\" target=\"_blank\" >Quantum Control and General Recursion beyond the Unitary Case<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Kathleen Barsse, Romain P\u00e9choux, Simon Perdrix<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">2026<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Preprints, Working Papers, &#8230;<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\"> <a href=\"https:\/\/arxiv.org\/pdf\/2507.10466\"  target=\"_blank\"><img decoding=\"async\" alt=\"https:\/\/arxiv.org\/pdf\/2507.10466\" src=\"https:\/\/haltools.inria.fr\/images\/arxiv.gif\" border=\"0\" title=\"arXiv PDF\" width=\"16px\" height=\"16px\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-05538043v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-05518918v1\" target=\"_blank\" >Resource-Aware Quantum Programming with General Recursion and Quantum Control<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Kostia Chardonnet, Emmanuel Hainry, Romain P\u00e9choux, Thomas Vinet<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">2026<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Preprints, Working Papers, &#8230;<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-05518918\/file\/2510.20452v2.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-05518918\/file\/2510.20452v2.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-05518918\/file\/2510.20452v2.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-05518918v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-05457001v1\" target=\"_blank\" >A programming language combining quantum and classical control<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Kinnari Dave, Louis Lemonnier, Romain P\u00e9choux, Vladimir Zamdzhiev<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">2026<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Preprints, Working Papers, &#8230;<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\"> <a href=\"https:\/\/arxiv.org\/pdf\/2511.22537\"  target=\"_blank\"><img decoding=\"async\" alt=\"https:\/\/arxiv.org\/pdf\/2511.22537\" src=\"https:\/\/haltools.inria.fr\/images\/arxiv.gif\" border=\"0\" title=\"arXiv PDF\" width=\"16px\" height=\"16px\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-05457001v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2025<\/p>\n<p class='SousRubrique'>Journal articles<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-05419254v1\" target=\"_blank\" >A Polytime Quantum Programming Language<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Romain P\u00e9choux, M\u00e1rio Silva<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>ACM Transactions on Quantum Computing<\/i>, 2025, 7 (1), pp.1 &#8211; 32. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3769851\">&#x27E8;10.1145\/3769851&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Journal articles<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1145\/3769851\" target=\"_blank\" >10.1145\/3769851<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-05419254\/file\/TQC_revised.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-05419254\/file\/TQC_revised.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-05419254\/file\/TQC_revised.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-05419254v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-05097335v1\" target=\"_blank\" >Complete and tractable machine-independent characterizations of second-order polytime<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Bruce M Kapron, Jean-Yves Marion, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Logical Methods in Computer Science<\/i>, 2025, Volume 21, Issue 1, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.46298\/lmcs-21(1:5)2025\">&#x27E8;10.46298\/lmcs-21(1:5)2025&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Journal articles<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.46298\/lmcs-21(1:5)2025\" target=\"_blank\" >10.46298\/lmcs-21(1:5)2025<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-05097335\/file\/2208.14739v5.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-05097335\/file\/2208.14739v5.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-05097335\/file\/2208.14739v5.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-05097335v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-05171674v2\" target=\"_blank\" >Quantum Programming in Polylogarithmic Time<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Florent Ferrari, Emmanuel Hainry, Romain P\u00e9choux, M\u00e1rio Silva<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Mathematical Foundations of Computer Science 2025<\/i>, Aug 2025, Varsovie, Poland. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.MFCS.2025.47\">&#x27E8;10.4230\/LIPIcs.MFCS.2025.47&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.4230\/LIPIcs.MFCS.2025.47\" target=\"_blank\" >10.4230\/LIPIcs.MFCS.2025.47<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/hal.science\/hal-05171674\/file\/main_hal.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-05171674\/file\/main_hal.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-05171674\/file\/main_hal.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-05171674v2\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-04823282v4\" target=\"_blank\" >Branch Sequentialization in Quantum Polytime<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Romain P\u00e9choux, M\u00e1rio Alberto Machado da Silva<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>FSCD 2025<\/i>, Jul 2025, Birmingham, United Kingdom. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.FSCD.2025.22\">&#x27E8;10.4230\/LIPIcs.FSCD.2025.22&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.4230\/LIPIcs.FSCD.2025.22\" target=\"_blank\" >10.4230\/LIPIcs.FSCD.2025.22<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-04823282\/file\/main_rewritten.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-04823282\/file\/main_rewritten.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-04823282\/file\/main_rewritten.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-04823282v4\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-05093249v1\" target=\"_blank\" >Combining quantum and classical control: syntax, semantics and adequacy<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Kinnari Dave, Louis Lemonnier, Romain P\u00e9choux, Vladimir Zamdzhiev<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>FoSSaCS 2025 &#8211; 28th International Conference on Foundations of Software Science and Computation Structures<\/i>, May 2025, Hamilton, Canada. pp.155-175, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-90897-2_8\">&#x27E8;10.1007\/978-3-031-90897-2_8&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1007\/978-3-031-90897-2_8\" target=\"_blank\" >10.1007\/978-3-031-90897-2_8<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/hal.science\/hal-05093249\/file\/combining-control-fossacs.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-05093249\/file\/combining-control-fossacs.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-05093249\/file\/combining-control-fossacs.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-05093249v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2024<\/p>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-04742085v1\" target=\"_blank\" >Declassification Policy for Program Complexity Analysis<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Bruce M Kapron, Jean-Yves Marion, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>LICS &rsquo;24: 39th Annual ACM\/IEEE Symposium on Logic in Computer Science<\/i>, Jul 2024, Tallinn Estonia, France. pp.1-14, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3661814.3662100\">&#x27E8;10.1145\/3661814.3662100&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1145\/3661814.3662100\" target=\"_blank\" >10.1145\/3661814.3662100<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-04742085\/file\/LICS24-112.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-04742085\/file\/LICS24-112.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-04742085\/file\/LICS24-112.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-04742085v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-04349874v1\" target=\"_blank\" >On the Hardness of Analyzing Quantum Programs Quantitatively<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Martin Avanzini, Georg Moser, Romain P\u00e9choux, Simon Perdrix<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>ESOP 2024 &#8211; 33rd European Symposium on Programming<\/i>, Apr 2024, Luxembourg, Luxembourg. pp.28, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-57267-8_2\">&#x27E8;10.1007\/978-3-031-57267-8_2&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1007\/978-3-031-57267-8_2\" target=\"_blank\" >10.1007\/978-3-031-57267-8_2<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-04349874\/file\/synthesis-hal.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-04349874\/file\/synthesis-hal.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-04349874\/file\/synthesis-hal.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-04349874v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Preprints, Working Papers, &#8230;<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-04266203v3\" target=\"_blank\" >A feasible and unitary quantum programming language<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Alejandro D\u00edaz-Caro, Emmanuel Hainry, Romain P\u00e9choux, M\u00e1rio Silva<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">2024<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Preprints, Working Papers, &#8230;<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-04266203\/file\/main.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-04266203\/file\/main.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-04266203\/file\/main.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-04266203v3\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2023<\/p>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-03895081v3\" target=\"_blank\" >A programming language characterizing quantum polynomial time<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Romain P\u00e9choux, M\u00e1rio Silva<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>FOSSACS 2023 &#8211; 26th International Conference on Foundations of Software Science and Computational Structures<\/i>, Orna Kupferman; Pawel Sobocinski, Apr 2023, Paris, France. pp.156-175, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-30829-1_8\">&#x27E8;10.1007\/978-3-031-30829-1_8&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1007\/978-3-031-30829-1_8\" target=\"_blank\" >10.1007\/978-3-031-30829-1_8<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-03895081\/file\/FBQP_Implicit.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-03895081\/file\/FBQP_Implicit.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-03895081\/file\/FBQP_Implicit.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-03895081v3\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-04190355v1\" target=\"_blank\" >A General Noninterference Policy for Polynomial Time<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>POPL 23<\/i>, Jan 2023, Boston, United States. pp.806 &#8211; 832, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3571221\">&#x27E8;10.1145\/3571221&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1145\/3571221\" target=\"_blank\" >10.1145\/3571221<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-04190355\/file\/shapedTiering.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-04190355\/file\/shapedTiering.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-04190355\/file\/shapedTiering.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-04190355v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2022<\/p>\n<p class='SousRubrique'>Journal articles<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-03722168v1\" target=\"_blank\" >A tier-based typed programming language characterizing Feasible Functionals<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Bruce Kapron, Jean-Yves Marion, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Logical Methods in Computer Science<\/i>, 2022, 18 (1), pp.31. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.46298\/LMCS-18(1:33)2022\">&#x27E8;10.46298\/LMCS-18(1:33)2022&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Journal articles<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.46298\/LMCS-18(1:33)2022\" target=\"_blank\" >10.46298\/LMCS-18(1:33)2022<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-03722168\/file\/hkmplmcs.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-03722168\/file\/hkmplmcs.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-03722168\/file\/hkmplmcs.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-03722168v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-03540366v1\" target=\"_blank\" >Quantum Expectation Transformers for Cost Analysis<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Martin Avanzini, Georg Moser, Romain P\u00e9choux, Simon Perdrix, Vladimir Zamdzhiev<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Symposium on Logic In Computer Science LICS \u201922<\/i>, Aug 2022, Haifa, Israel<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-03540366\/file\/AVGQ.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-03540366\/file\/AVGQ.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-03540366\/file\/AVGQ.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-03540366v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-03722245v3\" target=\"_blank\" >Complete and tractable machine-independent characterizations of second-order polytime<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Bruce M Kapron, Jean-Yves Marion, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>FoSSaCS 2022 &#8211; 25th International Conference on Foundations of Software Science and Computation Structures<\/i>, Apr 2022, Munich, Germany. pp.368-388, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-99253-8_19\">&#x27E8;10.1007\/978-3-030-99253-8_19&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1007\/978-3-030-99253-8_19\" target=\"_blank\" >10.1007\/978-3-030-99253-8_19<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-03722245\/file\/ctcbff.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-03722245\/file\/ctcbff.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-03722245\/file\/ctcbff.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-03722245v3\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Poster communications<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-03895106v1\" target=\"_blank\" >An imperative programming language characterizing FBQP<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Romain P\u00e9choux, M\u00e1rio Silva<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>QPL 2022 &#8211; Quantum Physics and Logic<\/i>, Jun 2022, Oxford, United Kingdom. <a target=\"_blank\" href=\"https:\/\/www.qplconference.org\/\"><\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Poster communications<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-03895106\/file\/27Silva.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-03895106\/file\/27Silva.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-03895106\/file\/27Silva.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-03895106v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2021<\/p>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-03337755v1\" target=\"_blank\" >ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Emmanuel Jeandel, Romain P\u00e9choux, Olivier Zeyen<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>ICTAC 2021 &#8211; 18th International Colloquium on Theoretical Aspects of Computing<\/i>, Sep 2021, Nur-Sultan\/Virtual, Kazakhstan. pp.357-365, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-85315-0_20\">&#x27E8;10.1007\/978-3-030-85315-0_20&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1007\/978-3-030-85315-0_20\" target=\"_blank\" >10.1007\/978-3-030-85315-0_20<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-03337755\/file\/ictac-tool.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-03337755\/file\/ictac-tool.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-03337755\/file\/ictac-tool.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-03337755v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2020<\/p>\n<p class='SousRubrique'>Journal articles<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-02499206v2\" target=\"_blank\" >Theory of Higher Order Interpretations and Application to Basic Feasible Functions<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Logical Methods in Computer Science<\/i>, 2020, 16 (4), pp.25. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.23638\/LMCS-16(4:14)2020\">&#x27E8;10.23638\/LMCS-16(4:14)2020&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Journal articles<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.23638\/LMCS-16(4:14)2020\" target=\"_blank\" >10.23638\/LMCS-16(4:14)2020<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-02499206\/file\/1801.08350v4.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-02499206\/file\/1801.08350v4.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-02499206\/file\/1801.08350v4.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-02499206v2\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-02153506v2\" target=\"_blank\" >On the efficiency of normal form systems for representing Boolean functions<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Miguel Couceiro, Erkko Lehtonen, Pierre Mercuriali, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Theoretical Computer Science<\/i>, 2020, 813, pp.341-361. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.tcs.2020.01.009\">&#x27E8;10.1016\/j.tcs.2020.01.009&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Journal articles<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1016\/j.tcs.2020.01.009\" target=\"_blank\" >10.1016\/j.tcs.2020.01.009<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-02153506\/file\/TCS_HAL_CLMP.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-02153506\/file\/TCS_HAL_CLMP.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-02153506\/file\/TCS_HAL_CLMP.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-02153506v2\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-02881308v1\" target=\"_blank\" >A tier-based typed programming language characterizing Feasible Functionals<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Bruce Kapron, Jean-Yves Marion, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>LICS &rsquo;20 &#8211; 35th Annual ACM\/IEEE Symposium on Logic in Computer Science<\/i>, Jul 2020, Saarbr\u00fccken, Germany. pp.535-549, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3373718.3394768\">&#x27E8;10.1145\/3373718.3394768&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1145\/3373718.3394768\" target=\"_blank\" >10.1145\/3373718.3394768<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-02881308\/file\/bff-lics.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-02881308\/file\/bff-lics.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-02881308\/file\/bff-lics.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-02881308v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-02995410v1\" target=\"_blank\" >Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Romain P\u00e9choux, Simon Perdrix, Mathys Rennela, Vladimir Zamdzhiev<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>International Conference on Foundations of Software Science and Computation Structures<\/i>, Apr 2020, Dublin, Ireland. pp.562-581, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-45231-5_29\">&#x27E8;10.1007\/978-3-030-45231-5_29&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1007\/978-3-030-45231-5_29\" target=\"_blank\" >10.1007\/978-3-030-45231-5_29<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\"> <a href=\"https:\/\/arxiv.org\/pdf\/1910.09633\"  target=\"_blank\"><img decoding=\"async\" alt=\"https:\/\/arxiv.org\/pdf\/1910.09633\" src=\"https:\/\/haltools.inria.fr\/images\/arxiv.gif\" border=\"0\" title=\"arXiv PDF\" width=\"16px\" height=\"16px\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-02995410v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-02499149v1\" target=\"_blank\" >Polynomial time over the reals with parsimony<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Damiano Mazza, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>FLOPS 2020 &#8211; International Symposium on Functional and Logic Programming<\/i>, Apr 2020, Akita, Japan<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-02499149\/file\/main.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-02499149\/file\/main.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-02499149\/file\/main.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-02499149v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Habilitation \u00e0 diriger des recherches<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.univ-lorraine.fr\/tel-02978986v3\" target=\"_blank\" >Implicit Computational Complexity: past and future<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">Complexit\u00e9 [cs.CC]. Universit\u00e9 de Lorraine, 2020<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Habilitation \u00e0 diriger des recherches<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/hal.univ-lorraine.fr\/tel-02978986\/file\/HDR-RP.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/hal.univ-lorraine.fr\/tel-02978986\/file\/HDR-RP.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.univ-lorraine.fr\/tel-02978986\/file\/HDR-RP.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.univ-lorraine.fr\/tel-02978986v3\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Preprints, Working Papers, &#8230;<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-03018513v1\" target=\"_blank\" >Quantum Programming with Inductive Datatypes<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Romain P\u00e9choux, Simon Perdrix, Mathys Rennela, Vladimir Zamdzhiev<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">2020<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Preprints, Working Papers, &#8230;<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/hal.science\/hal-03018513\/file\/qpl-inductive.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-03018513\/file\/qpl-inductive.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-03018513\/file\/qpl-inductive.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-03018513v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2019<\/p>\n<p class='SousRubrique'>Journal articles<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-01905491v1\" target=\"_blank\" >On the complexity of minimizing median normal forms of monotone Boolean functions and lattice polynomials<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Miguel Couceiro, Pierre Mercuriali, Romain P\u00e9choux, Abdallah Saffidine<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Journal of Multiple-Valued Logic and Soft Computing<\/i>, 2019, 33 (3), pp.197-218<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Journal articles<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-01905491\/file\/median_computations_MVLSC-CMPS.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01905491\/file\/median_computations_MVLSC-CMPS.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01905491\/file\/median_computations_MVLSC-CMPS.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01905491v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-02499318v1\" target=\"_blank\" >Tiered complexity at higher order<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Bruce Kapron, Jean-Yves Marion, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>DICE-FOPARA 2019 &#8211; Joint international workshop on Developments in Implicit Computational complExity and Foundational and Practical Aspects of Resource Analysis<\/i>, Apr 2019, Praha, Czech Republic<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-02499318\/file\/paper%209.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-02499318\/file\/paper%209.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-02499318\/file\/paper%209.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-02499318v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-02499348v1\" target=\"_blank\" >Tiered complexity at higher order<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Bruce Kapron, Jean-Yves Marion, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>MLA&rsquo;2019 &#8211; Third Workshop on Mathematical Logic and its Applications<\/i>, Mar 2019, Nancy, France<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\"> <a href=\"https:\/\/inria.hal.science\/hal-02499348v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/dd>\n<\/dl>\n<p class='Rubrique'>2018<\/p>\n<p class='SousRubrique'>Journal articles<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-01712506v1\" target=\"_blank\" >A Type-Based Complexity Analysis of Object Oriented Programs<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Information and Computation<\/i>, 2018, Information and Computation, 261 (1), pp.78-115. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.ic.2018.05.006\">&#x27E8;10.1016\/j.ic.2018.05.006&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Journal articles<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1016\/j.ic.2018.05.006\" target=\"_blank\" >10.1016\/j.ic.2018.05.006<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-01712506\/file\/Object.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01712506\/file\/Object.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01712506\/file\/Object.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01712506v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-02499377v1\" target=\"_blank\" >Normal form systems generated by single connectives have mutually equivalent efficiency<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Miguel Couceiro, Erkko Lehtonen, Pierre Mercuriali, Romain P\u00e9choux, Mathias Soeken<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>DICE 2018 &#8211; Developments in Implicit Computational Complexity<\/i>, Apr 2018, Thessaloniki, Greece. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.DICE.2016.1\">&#x27E8;10.4230\/LIPIcs.DICE.2016.1&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.4230\/LIPIcs.DICE.2016.1\" target=\"_blank\" >10.4230\/LIPIcs.DICE.2016.1<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-02499377\/file\/DICE_2018_paper_7.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-02499377\/file\/DICE_2018_paper_7.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-02499377\/file\/DICE_2018_paper_7.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-02499377v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2017<\/p>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-01656033v1\" target=\"_blank\" >On the efficiency of normal form systems of Boolean functions<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Miguel Couceiro, Pierre Mercuriali, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>LFA 2017 &#8211; 26\u00e8mes Rencontres Francophones sur la Logique Floue et ses Applications<\/i>, Oct 2017, Amiens, France. pp.1-8<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-01656033\/file\/LFA_2017_paper_7.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01656033\/file\/LFA_2017_paper_7.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01656033\/file\/LFA_2017_paper_7.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01656033v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-01504010v1\" target=\"_blank\" >Median based calculus for lattice polynomials and monotone Boolean functions<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Miguel Couceiro, Pierre Mercuriali, Romain P\u00e9choux, Abdallah Saffidine<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>ISMVL 2017 &#8211; 47th IEEE International Symposium on Multiple-Valued Logic<\/i>, May 2017, Novi Sad, Serbia. pp.6<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-01504010\/file\/median-computations-Revised.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01504010\/file\/median-computations-Revised.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01504010\/file\/median-computations-Revised.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01504010v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-01529170v2\" target=\"_blank\" >Higher-order interpretations for higher-order complexity<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>LPAR 2017 &#8211; International Conferences on Logic for Programming, Artificial Intelligence and Reasoning<\/i>, Geoff Sutcliffe, May 2017, Maun, Botswana. pp.269-285<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-01529170\/file\/lpar.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01529170\/file\/lpar.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01529170\/file\/lpar.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01529170v2\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-01653659v1\" target=\"_blank\" >Higher order interpretations for higher order complexity<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>8th Workshop on Developments in Implicit Computational complExity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis<\/i>, Apr 2017, Uppsala, Sweden<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-01653659\/file\/HP.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01653659\/file\/HP.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01653659\/file\/HP.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01653659v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Preprints, Working Papers, &#8230;<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-01551761v1\" target=\"_blank\" >Comparing the efficiency of normal form systems to represent Boolean functions<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Miguel Couceiro, Pierre Mercuriali, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">2017<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Preprints, Working Papers, &#8230;<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-01551761\/file\/comparing%20normal%20form%20systems%2030%2006%202017.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01551761\/file\/comparing%20normal%20form%20systems%2030%2006%202017.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01551761\/file\/comparing%20normal%20form%20systems%2030%2006%202017.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01551761v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2015<\/p>\n<p class='SousRubrique'>Journal articles<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-01112160v1\" target=\"_blank\" >Characterizing polynomial time complexity of stream programs using interpretations<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Hugo F\u00e9r\u00e9e, Emmanuel Hainry, Mathieu Hoyrup, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Theoretical Computer Science<\/i>, 2015, 585, pp.41-54. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.tcs.2015.03.008\">&#x27E8;10.1016\/j.tcs.2015.03.008&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Journal articles<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1016\/j.tcs.2015.03.008\" target=\"_blank\" >10.1016\/j.tcs.2015.03.008<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-01112160\/file\/FEREE_HAINRY_HOYRUP_PECHOUX.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01112160\/file\/FEREE_HAINRY_HOYRUP_PECHOUX.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01112160\/file\/FEREE_HAINRY_HOYRUP_PECHOUX.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01112160v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-01112161v1\" target=\"_blank\" >On Bounding Space Usage of Streams Using Interpretation Analysis<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Marco Gaboardi, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Science of Computer Programming<\/i>, 2015, pp.44<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Journal articles<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-01112161\/file\/main-submitted.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01112161\/file\/main-submitted.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01112161\/file\/main-submitted.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01112161v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-01206161v1\" target=\"_blank\" >Objects in Polynomial Time<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>APLAS 2015<\/i>, Nov 2015, Pohang, South Korea. pp.387&#8211;404, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-26529-2_21\">&#x27E8;10.1007\/978-3-319-26529-2_21&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1007\/978-3-319-26529-2_21\" target=\"_blank\" >10.1007\/978-3-319-26529-2_21<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-01206161\/file\/ICCOW.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01206161\/file\/ICCOW.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01206161\/file\/ICCOW.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01206161v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-01112165v1\" target=\"_blank\" >Algebras and Coalgebras in the Light Affine Lambda Calculus<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Marco Gaboardi, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>The 20th ACM SIGPLAN International Conference on Functional Programming (ICFP 2015)<\/i>, Aug 2015, Vancouver, Canada<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-01112165\/file\/main.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01112165\/file\/main.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01112165\/file\/main.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01112165v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-01207918v1\" target=\"_blank\" >Implicit computational complexity in Object Oriented Programs<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>DICE 2015 &#8211; Developments in Implicit Computational Complexity<\/i>, Apr 2015, London, United Kingdom<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\"> <a href=\"https:\/\/inria.hal.science\/hal-01207918v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-01207910v1\" target=\"_blank\" >Higher order interpretations for Basic Feasible Functions<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>DICE 2015 &#8211; Developments in Implicit Computational Complexity<\/i>, Apr 2015, London, United Kingdom<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\"> <a href=\"https:\/\/inria.hal.science\/hal-01207910v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/dd>\n<\/dl>\n<p class='Rubrique'>2014<\/p>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-01084043v1\" target=\"_blank\" >Complexity Information Flow in a Multi-threaded Imperative Language<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Jean-Yves Marion, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>TAMC 2014<\/i>, Apr 2014, Chennai, India. pp.124 &#8211; 140, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-06089-7_9\">&#x27E8;10.1007\/978-3-319-06089-7_9&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1007\/978-3-319-06089-7_9\" target=\"_blank\" >10.1007\/978-3-319-06089-7_9<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-01084043\/file\/hulotte.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01084043\/file\/hulotte.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01084043\/file\/hulotte.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01084043v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-01084041v1\" target=\"_blank\" >A Categorical Treatment of Malicious Behavioral Obfuscation<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Romain P\u00e9choux, Thanh Dinh Ta<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>TAMC 2014<\/i>, Apr 2014, Chennai, India. pp.280 &#8211; 299, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-06089-7_20\">&#x27E8;10.1007\/978-3-319-06089-7_20&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1007\/978-3-319-06089-7_20\" target=\"_blank\" >10.1007\/978-3-319-06089-7_20<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-01084041\/file\/paper48-Ta-Pechoux.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-01084041\/file\/paper48-Ta-Pechoux.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-01084041\/file\/paper48-Ta-Pechoux.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-01084041v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2013<\/p>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-00910166v1\" target=\"_blank\" >Types for controlling heap and stack in Java<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Third International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA)<\/i>, Ugo Dal Lago and Ricardo Pena, Aug 2013, Bertinoro, Italy<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-00910166\/file\/ObjectIsBeautiful.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-00910166\/file\/ObjectIsBeautiful.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-00910166\/file\/ObjectIsBeautiful.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-00910166v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-00910170v1\" target=\"_blank\" >Bounding Reactions in the Pi-calculus using Interpretations<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Third International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA 2013)<\/i>, Ugo Dal Lago and Ricardo Pena, Aug 2013, Bertinoro, Italy<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-00910170\/file\/R.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-00910170\/file\/R.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-00910170\/file\/R.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-00910170v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-00755450v2\" target=\"_blank\" >Type-based complexity analysis for fork processes<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Jean-Yves Marion, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>16th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS)<\/i>, Mar 2013, Rome, Italy. pp.305-320, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-37075-5_20\">&#x27E8;10.1007\/978-3-642-37075-5_20&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1007\/978-3-642-37075-5_20\" target=\"_blank\" >10.1007\/978-3-642-37075-5_20<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-00755450\/file\/fossacs.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-00755450\/file\/fossacs.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-00755450\/file\/fossacs.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-00755450v2\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Other publications<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-00773141v4\" target=\"_blank\" >Type-based heap and stack space analysis in Java<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Emmanuel Hainry, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">2013<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Other publications<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-00773141\/file\/ObjectIsBeautiful.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-00773141\/file\/ObjectIsBeautiful.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-00773141\/file\/ObjectIsBeautiful.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-00773141v4\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2012<\/p>\n<p class='SousRubrique'>Journal articles<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-00744915v1\" target=\"_blank\" >Synthesis of sup-interpretations: a survey<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Theoretical Computer Science<\/i>, 2012, pp.24. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.tcs.2012.11.003\">&#x27E8;10.1016\/j.tcs.2012.11.003&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Journal articles<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1016\/j.tcs.2012.11.003\" target=\"_blank\" >10.1016\/j.tcs.2012.11.003<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-00744915\/file\/main.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-00744915\/file\/main.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-00744915\/file\/main.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-00744915v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Reports<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-00684026v1\" target=\"_blank\" >Complexity Information Flow in a Multi-threaded Imperative Language<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Jean-Yves Marion, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">[Research Report] 2012, pp.16<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Reports<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-00684026\/file\/hulotte.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-00684026\/file\/hulotte.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-00684026\/file\/hulotte.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-00684026v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2010<\/p>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/inria-00518381v1\" target=\"_blank\" >Interpretation of stream programs: characterizing type 2 polynomial time complexity<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Hugo F\u00e9r\u00e9e, Emmanuel Hainry, Mathieu Hoyrup, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>21st International Symposium on Algorithms and Computation &#8211; ISAAC 2010<\/i>, Dec 2010, Jeju Island, South Korea<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/inria-00518381\/file\/paper.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/inria-00518381\/file\/paper.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/inria-00518381\/file\/paper.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/inria-00518381v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2009<\/p>\n<p class='SousRubrique'>Journal articles<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/inria-00446057v1\" target=\"_blank\" >Sup-interpretations, a semantic method for static analysis of program resources<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Jean-Yves Marion, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>ACM Transactions on Computational Logic<\/i>, 2009, 10 (4), 30 p. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/1555746.1555751\">&#x27E8;10.1145\/1555746.1555751&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Journal articles<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1145\/1555746.1555751\" target=\"_blank\" >10.1145\/1555746.1555751<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/inria-00446057\/file\/333pechoux.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/inria-00446057\/file\/333pechoux.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/inria-00446057\/file\/333pechoux.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/inria-00446057v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/inria-00539835v1\" target=\"_blank\" >Global and local space properties of stream programs<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Marco Gaboardi, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>FOPARA 2009 &#8211; First International Workshop on Foundational and Practical Aspects of Resource Analysis<\/i>, Nov 2009, Eindhoven, Netherlands. pp.51&#8211;66, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-15331-0_4\">&#x27E8;10.1007\/978-3-642-15331-0_4&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1007\/978-3-642-15331-0_4\" target=\"_blank\" >10.1007\/978-3-642-15331-0_4<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/inria-00539835\/file\/main.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/inria-00539835\/file\/main.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/inria-00539835\/file\/main.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/inria-00539835v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/inria-00431469v1\" target=\"_blank\" >Upper Bounds on Stream I\/O Using Semantic Interpretations<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Marco Gaboardi, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>23rd international Workshop on Computer Science Logic, CSL 2009, 18th Annual Conference of the EACSL<\/i>, Sep 2009, Coimbra, Portugal. pp.271-286, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-04027-6_21\">&#x27E8;10.1007\/978-3-642-04027-6_21&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1007\/978-3-642-04027-6_21\" target=\"_blank\" >10.1007\/978-3-642-04027-6_21<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/inria-00431469\/file\/csl.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/inria-00431469\/file\/csl.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/inria-00431469\/file\/csl.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/inria-00431469v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2008<\/p>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/inria-00332550v1\" target=\"_blank\" >Analyzing the Implicit Computational Complexity of object-oriented programs<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Jean-Yves Marion, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Annual Conference on Foundations of Software Technology and Theoretical Computer Science &#8211; FSTTCS 2008<\/i>, IARCS, the Indian Association for Research in Computing Science, Dec 2008, Bangalore, India<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/inria-00332550\/file\/paper28.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/inria-00332550\/file\/paper28.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/inria-00332550\/file\/paper28.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/inria-00332550v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/inria-00332389v1\" target=\"_blank\" >Characterizations of Polynomial Complexity Classes with a Better Intensionality<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Jean-Yves Marion, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Proceedings of the 10th international ACM SIGPLAN conference on Principles and Practice of Declarative Programming &#8211; PPDP 2008<\/i>, Universidad Polytechnica, Jul 2008, Valencia, Spain. pp.79-88, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/1389449.1389460\">&#x27E8;10.1145\/1389449.1389460&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1145\/1389449.1389460\" target=\"_blank\" >10.1145\/1389449.1389460<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/inria-00332389\/file\/ppdp09-pechoux.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/inria-00332389\/file\/ppdp09-pechoux.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/inria-00332389\/file\/ppdp09-pechoux.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/inria-00332389v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/inria-00332390v1\" target=\"_blank\" >A Characterization of NCk by First Order Functional Programs<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Jean-Yves Marion, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>5th International Conference on Theory and Applications of Models of Computation &#8211; TAMC 2008<\/i>, Xidian University, Apr 2008, Xian, China. pp.136-147, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-540-79228-4\">&#x27E8;10.1007\/978-3-540-79228-4&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1007\/978-3-540-79228-4\" target=\"_blank\" >10.1007\/978-3-540-79228-4<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/inria-00332390\/file\/paper69.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/inria-00332390\/file\/paper69.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/inria-00332390\/file\/paper69.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/inria-00332390v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2007<\/p>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/inria-00130920v1\" target=\"_blank\" >Quasi-interpretation Synthesis by Decomposition : An application to higher-order programs<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Guillaume Bonfante, Jean-Yves Marion, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>ICTAC<\/i>, Sep 2007, Macao, China<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/inria-00130920\/file\/modu.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/inria-00130920\/file\/modu.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/inria-00130920\/file\/modu.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/inria-00130920v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/inria-00155288v1\" target=\"_blank\" >Resource control of object-oriented programs<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Jean-Yves Marion, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>The International Workshop on Logic and Computational Complexity &#8211; LCC 2007<\/i>, Jul 2007, Wroclaw\/Poland, Poland<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/inria-00155288\/file\/objet.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/inria-00155288\/file\/objet.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/inria-00155288\/file\/objet.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/inria-00155288v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Reports<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/inria-00155287v1\" target=\"_blank\" >A characterization of polynomial complexity classes using dependency pairs<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Jean-Yves Marion, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">[Research Report] 2007, pp.12<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Reports<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/inria-00155287\/file\/dependency.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/inria-00155287\/file\/dependency.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/inria-00155287\/file\/dependency.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/inria-00155287v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Theses<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/theses.hal.science\/tel-01752904v2\" target=\"_blank\" >Program complexity analysis by semantics interpretation<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Romain Pechoux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">Informatique [cs]. Institut National Polytechnique de Lorraine &#8211; INPL, 2007. Fran\u00e7ais. <a target=\"_blank\" href=\"https:\/\/www.theses.fr\/2007INPL084N\">&#x27E8;NNT : 2007INPL084N&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Theses<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/theses.hal.science\/tel-01752904\/file\/manuscrit.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/theses.hal.science\/tel-01752904\/file\/manuscrit.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/theses.hal.science\/tel-01752904\/file\/manuscrit.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/theses.hal.science\/tel-01752904v2\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2006<\/p>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/inria-00110014v1\" target=\"_blank\" >A characterization of Alternating log time by first order functional programs<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Romain P\u00e9choux, Jean-Yves Marion, Guillaume Bonfante<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>13th International Conference on Logic for Programming Artificial Intelligence and Reasoning &#8211; LPAR-13<\/i>, Nov 2006, Phnom Penh\/Cambodia<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/inria-00110014\/file\/44.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/inria-00110014\/file\/44.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/inria-00110014\/file\/44.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/inria-00110014v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/inria-00110245v1\" target=\"_blank\" >Quasi-friendly sup-interpretations<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Jean-Yves Marion, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>8th International Workshop on Logic and Computational Complexity &#8211; LCC 2006 &#8211; LICS affiliated Workshop<\/i>, James Royer, Aug 2006, Seattle\/Etats-Unis<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/inria-00110245\/file\/lcc2006.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/inria-00110245\/file\/lcc2006.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/inria-00110245\/file\/lcc2006.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/inria-00110245v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/inria-00000661v2\" target=\"_blank\" >Resource analysis by sup-interpretation<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Jean-Yves Marion, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Eighth International Symposium on Functional and Logic Programming &#8211; FLOPS 2006<\/i>, Apr 2006, Fuji Susono, Japan. pp.163&#8211;176, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/11737414_12\">&#x27E8;10.1007\/11737414_12&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1007\/11737414_12\" target=\"_blank\" >10.1007\/11737414_12<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/inria-00000661\/file\/fullpaper.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/inria-00000661\/file\/fullpaper.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/inria-00000661\/file\/fullpaper.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/inria-00000661v2\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2005<\/p>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/inria-00000660v1\" target=\"_blank\" >Synthesis of Quasi-interpretations<\/a><\/dd>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen, Romain P\u00e9choux<\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Seventh International Workshop on Logic and Computational Complexity &#8211; LCC 2005<\/i>, Jun 2005, Chicago\/USA<\/dd>\n<dt class=\"ChampRes\">typdoc<\/dt>\n<dd class=\"ValeurRes Type_de_document\">Conference papers<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/inria-00000660\/file\/LCC05.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/inria-00000660\/file\/LCC05.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/inria-00000660\/file\/LCC05.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/inria-00000660v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl><\/div>\n<p> <\/body> <\/html> <\/p>\n","protected":false},"excerpt":{"rendered":"<p>               var _paq = _paq || [];   _paq.push([&lsquo;trackPageView&rsquo;]);   _paq.push([&lsquo;enableLinkTracking&rsquo;]);   (function() {     var u=\u00a0\u00bb\/\/piwik.inria.fr\/\u00a0\u00bb;     _paq.push([&lsquo;setTrackerUrl&rsquo;, u+&rsquo;piwik.php&rsquo;]);     _paq.push([&lsquo;setSiteId&rsquo;, 25]);     var d=document, g=d.createElement(&lsquo;script&rsquo;), s=d.getElementsByTagName(&lsquo;script&rsquo;)[0];     g.type=&rsquo;text\/javascript&rsquo;; g.async=true; g.defer=true; g.src=u+&rsquo;piwik.js&rsquo;; s.parentNode.insertBefore(g,s);   })();  <\/p>\n<p><img decoding=\"async\" src=\"\/\/piwik.inria.fr\/piwik.php?idsite=25\" style=\"border:0;\" alt=\"\" \/><\/p>\n<p>   Publications HAL de  romain p\u00e9choux   <\/p>\n<p class='Rubrique'>2026<\/p>\n<p class='SousRubrique'>Preprints, Working Papers, &#8230;<\/p>\n<p>titre<br \/>\n<a href=\"https:\/\/hal.science\/hal-05538043v1\" target=\"_blank\">Quantum Control and General Recursion beyond the Unitary Case<\/a><br \/>\nauteur<br \/>\nKathleen Barsse, Romain P\u00e9choux, Simon Perdrix<br \/>\narticle<br \/>\n2026<br \/>\ntypdoc<br \/>\nPreprints, Working Papers, &#8230;<br \/>\nAcc\u00e8s au bibtex<br \/>\n <a href=\"https:\/\/arxiv.org\/pdf\/2507.10466\"  target=\"_blank\"><img decoding=\"async\" alt=\"https:\/\/arxiv.org\/pdf\/2507.10466\" src=\"https:\/\/haltools.inria.fr\/images\/arxiv.gif\" border=\"0\" title=\"arXiv PDF\" width=\"16px\" height=\"16px\" \/><\/a> <a href=\"https:\/\/hal.science\/hal-05538043v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/p>\n<p>titre<br \/>\n<a href=\"https:\/\/inria.hal.science\/hal-05518918v1\" target=\"_blank\">Resource-Aware Quantum Programming with General Recursion and Quantum Control<\/a><br \/>\nauteur<br \/>\nKostia Chardonnet, Emmanuel Hainry, Romain P\u00e9choux, <\/p>\n","protected":false},"author":5,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-13","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/members.loria.fr\/RPechoux\/wp-json\/wp\/v2\/pages\/13","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/members.loria.fr\/RPechoux\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/members.loria.fr\/RPechoux\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/members.loria.fr\/RPechoux\/wp-json\/wp\/v2\/users\/5"}],"replies":[{"embeddable":true,"href":"https:\/\/members.loria.fr\/RPechoux\/wp-json\/wp\/v2\/comments?post=13"}],"version-history":[{"count":29,"href":"https:\/\/members.loria.fr\/RPechoux\/wp-json\/wp\/v2\/pages\/13\/revisions"}],"predecessor-version":[{"id":800,"href":"https:\/\/members.loria.fr\/RPechoux\/wp-json\/wp\/v2\/pages\/13\/revisions\/800"}],"wp:attachment":[{"href":"https:\/\/members.loria.fr\/RPechoux\/wp-json\/wp\/v2\/media?parent=13"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}