| CARVIEW |
Select Language
HTTP/2 200
server: nginx
date: Sun, 28 Dec 2025 15:36:26 GMT
content-type: text/html
content-length: 7557
last-modified: Fri, 15 Nov 2024 19:35:18 GMT
x-sso-wat: You've just been SSOed
etag: "6737a276-1d85"
content-security-policy: upgrade-insecure-requests
x-content-type-options: nosniff
x-xss-protection: 1; mode=block
x-download-options: noopen
x-permitted-cross-domain-policies: none
x-frame-options: SAMEORIGIN
permissions-policy: interest-cohort=()
strict-transport-security: max-age=63072000; includeSubDomains; preload
accept-ranges: bytes
Hugo Férée
Hugo Férée
Email:
name@irif.fr
name@irif.fr
Address:
office 4011,
bâtiment Sophie Germain,
8 place Aurélie Nemours,
75013 Paris, France
office 4011,
bâtiment Sophie Germain,
8 place Aurélie Nemours,
75013 Paris, France
Maître de conférences (lecturer) at Université Paris Cité , in the IRIF lab.
Publications
Articles
- Game semantics approach to higher order complexity
Hugo Férée
Journal of Computer and System Sciences 2017 [PDF] - Characterizing polynomial time complexity of stream programs using interpretations
Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux
Theoretical Computer Science 2015 [HAL] - Analytical properties of resource-bounded real functionals
Hugo Férée, Walid Gomaa, Mathieu Hoyrup
Journal of Complexity 2014 [HAL]
Conferences
- Mechanised uniform interpolation for modal logics K, GL and iSL[new,best paper award]
Hugo Férée, Iris van der Giessen, Sam van Gool, and Ian Shillito
IJCAR 2024 [PDF, demo] - Formalizing and Computing Propositional Quantifiers
Hugo Férée, Sam van Gool
CPP 2023 [PDF] - Characterising Renaming within OCaml’s Module System: Theory and Implementation
Reuben N. S. Rowe, Hugo Férée, Simon Thompson, Scott Owens
PLDI 2019 [PDF] - Program Verification in the Presence of I/O Semantics, verified library routines, and verified applications
Hugo Férée, Johannes Åman Pohjola, Ramana Kumar, Scott Owens, Magnus O. Myreen, and Son Ho
VSTTE 2018 [PDF] - Formal Proof of Polynomial-Time Complexity with Quasi-Interpretations
Hugo Férée, Samuel Hym, Micaela Mayero, Jean-Yves Moyen, David Nowak
CPP 2018 [PDF] - On the Computational Complexity of Positive Linear
Functionals on C[0;1]
Hugo Férée, and Martin Ziegler
MACIS 2015 [PDF] (abstract in CCA 2015) - On the query complexity of real functionals
Hugo Férée, Walid Gomaa and Mathieu Hoyrup
LICS 2013 [HAL] - Higher-order complexity in analysis
Hugo Férée and Mathieu Hoyrup
CCA 2013 [HAL] - Interpretation of stream programs: characterizing type 2
polynomial time complexity
Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup and Romain Péchoux
ISAAC 2010 [HAL]
Previous positions
| 2016—2019 | Research Associate in the PLAS group of the School of Computing of the University of Kent. |
| 2015—2016 | Temporary teaching (Université Lille 3) and research position (ATER), in the research team 2XS of the CRIStAL lab. |
| 2015—2015 | Visiting postdoc in the Logik group at TU Darmstadt (January — June) |
| 2011—2014 | PhD student (LORIA lab). I defended my PhD [TEL(fr)] 10/12/2014 at Loria, advised by Jean-Yves Marion and Mathieu Hoyrup. |
| 2012—2014 | Teaching assistant, Faculté des Sciences et Technologies de Nancy, Université de Lorraine |