Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity. - Hugo Férée; Emmanuel Hainry; Mathieu Hoyrup; Romain Péchoux (ISAAC (1), 2010)

On the Query Complexity of Real Functionals. - Hugo Férée; Mathieu Hoyrup; Walid Gomaa 001 (LICS, 2013)

Analytical properties of resource-bounded real functionals. - Hugo Férée; Walid Gomaa 001; Mathieu Hoyrup (J. Complex., 2014)

Complexité d'ordre supérieur et analyse récursive. (Higher order complexity and computable analysis). - Hugo Férée (2014)

On the Computational Complexity of Positive Linear Functionals on C[0;1]. - Hugo Férée; Martin Ziegler 001 (MACIS, 2015)

Characterizing polynomial time complexity of stream programs using interpretations. - Hugo Férée; Emmanuel Hainry; Mathieu Hoyrup; Romain Péchoux (Theor. Comput. Sci., 2015)

Game semantics approach to higher-order complexity. - Hugo Férée (J. Comput. Syst. Sci., 2017)

Formal proof of polynomial-time complexity with quasi-interpretations. - Hugo Férée; Samuel Hym; Micaela Mayero; Jean-Yves Moyen; David Nowak (CPP, 2018)

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; Son Ho (VSTTE, 2018)

Rotor: a tool for renaming values in OCaml's module system. - Reuben N. S. Rowe; Hugo Férée; Simon J. Thompson; Scott Owens (IWOR@ICSE, 2019)

Characterising renaming within OCaml's module system: theory and implementation. - Reuben N. S. Rowe; Hugo Férée; Simon J. Thompson; Scott Owens (PLDI, 2019)

Formalizing and Computing Propositional Quantifiers. - Hugo Férée; Sam van Gool (CPP, 2023)

Mechanised Uniform Interpolation for Modal Logics K, GL, and iSL. - Hugo Férée; Iris van der Giessen; Sam van Gool; Ian Shillito (IJCAR (2), 2024)