Hugo Férée

15 papers A* 2B 2Journal 5Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Pitts and Intuitionistic Multi-Succedent: Uniform Interpolation for KM.
CoRR
Hugo Férée, Ian Shillito
2024 — conf
Mechanised Uniform Interpolation for Modal Logics K, GL, and iSL.
IJCAR (2)
Hugo Férée, Iris van der Giessen, Sam van Gool, Ian Shillito
2024 J jnl
Mechanised uniform interpolation for modal logics K, GL and iSL.
CoRR
Hugo Férée, Iris van der Giessen, Sam van Gool, Ian Shillito
2023 B conf
Formalizing and Computing Propositional Quantifiers.
CPP
Hugo Férée, Sam van Gool
2019 A* conf
Characterising renaming within OCaml's module system: theory and implementation.
PLDI
Reuben N. S. Rowe, Hugo Férée, Simon J. Thompson, Scott Owens
2019 — conf
Rotor: a tool for renaming values in OCaml's module system.
IWOR@ICSE
Reuben N. S. Rowe, Hugo Férée, Simon J. Thompson, Scott Owens
2018 B conf
Formal proof of polynomial-time complexity with quasi-interpretations.
CPP
Hugo Férée, Samuel Hym, Micaela Mayero, Jean-Yves Moyen, David Nowak
2018 — conf
Program Verification in the Presence of I/O - Semantics, Verified Library Routines, and Verified Applications.
VSTTE
Hugo Férée, Johannes Åman Pohjola, Ramana Kumar, Scott Owens, Magnus O. Myreen, Son Ho
2017 J jnl
Game semantics approach to higher-order complexity.
J. Comput. Syst. Sci.
Hugo Férée
2015 J jnl
Characterizing polynomial time complexity of stream programs using interpretations.
Theor. Comput. Sci.
Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux
2015 — conf
On the Computational Complexity of Positive Linear Functionals on
MACIS
Hugo Férée, Martin Ziegler
2014 J jnl
Analytical properties of resource-bounded real functionals.
J. Complex.
Hugo Férée, Walid Gomaa, Mathieu Hoyrup
2014 — —
Complexité d'ordre supérieur et analyse récursive. (Higher order complexity and computable analysis).
Hugo Férée
2013 A* conf
On the Query Complexity of Real Functionals.
LICS
Hugo Férée, Mathieu Hoyrup, Walid Gomaa
2010 — conf
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity.
ISAAC (1)
Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux