Hugo Férée

According to our database, Hugo Férée authored at least 13 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Mechanised uniform interpolation for modal logics K, GL and iSL.

Hugo Férée, Iris van der Giessen, Sam van Gool, Ian Shillito

CoRR, 2024

2023

Formalizing and Computing Propositional Quantifiers.

Hugo Férée, Sam van Gool

Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2023

2019

Characterising renaming within OCaml's module system: theory and implementation.

Reuben N. S. Rowe, Hugo Férée, Simon J. Thompson, Scott Owens

Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

Rotor: a tool for renaming values in OCaml's module system.

Reuben N. S. Rowe, Hugo Férée, Simon J. Thompson, Scott Owens

Proceedings of the 3rd International Workshop on Refactoring, 2019

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

Proceedings of the Verified Software. Theories, Tools, and Experiments, 2018

Formal proof of polynomial-time complexity with quasi-interpretations.

Hugo Férée, Samuel Hym, Micaela Mayero, Jean-Yves Moyen, David Nowak

Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2018

2017

Game semantics approach to higher-order complexity.

Hugo Férée

J. Comput. Syst. Sci., 2017

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

On the Computational Complexity of Positive Linear Functionals on <i>C</i>[0;1].

Hugo Férée, Martin Ziegler

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

2014

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

Hugo Férée

PhD thesis, 2014

Analytical properties of resource-bounded real functionals.

Hugo Férée, Walid Gomaa, Mathieu Hoyrup

J. Complex., 2014

2013

On the Query Complexity of Real Functionals.

Hugo Férée, Mathieu Hoyrup, Walid Gomaa

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2010

Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity.

Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010