Items where Author, Editor or other role is "Feree, Hugo"
![[up]](/style/images/multi_up.png)
Up a levelNumber of items: 9.
2019
| Rowe, Reuben, Férée, Hugo, Thompson, Simon, Owens, Scott (2019) Characterising Renaming within OCaml’s Module System: Theory and Implementation. In: PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI '19: ACM SIGPLAN Conference on Programming Language Design and Implementation Proceedings. . pp. 950-965. ACM, ACM New York, NY, USA ©2019 ISBN 978-1-4503-6712-7. (doi:10.1145/3314221.3314600) (KAR id:73526) |
|
| Rowe, Reuben, Férée, Hugo, Thompson, Simon, Owens, Scott (2019) ROTOR : A Tool for Renaming Values in OCaml's Module System. In: 2019 IEEE/ACM 3rd International Workshop on Refactoring (IWoR). . pp. 27-30. IEEE Press ISBN 978-1-7281-2271-7. E-ISBN 978-1-7281-2270-0. (doi:10.1109/IWoR.2019.00013) (KAR id:80338) |
|
2018
| Férée, Hugo and Pohjola, Johannes Aman and Kumar, Ramana and Owens, Scott and Myreen, Magnus O. and Ho, Son (2018) Program Verification in the Presence of I/O. In: Verified Software. Theories, Tools, and Experiments. Lecture Notes in Computer Science . Springer. ISBN 978-3-030-03591-4. (doi:10.1007/978-3-030-03592-1_6) (KAR id:71298) |
|
| Férée, Hugo and Hym, Samuel and Mayero, Micaela and Moyen, Jean-Yves and Nowak, David (2018) Formal Proof of Polynomial-Time Complexity with Quasi-Interpretations. In: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs. POPL Principles of Programming Languages . ACM, New York, USA. ISBN 978-1-4503-5586-5. (doi:10.1145/3167097) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided) (KAR id:66330) |
|
2017
| Férée, Hugo (2017) Game semantics approach to higher-order complexity. Journal of Computer and System Sciences, 87 . pp. 1-15. ISSN 0022-0000. (doi:10.1016/j.jcss.2017.02.003) (KAR id:64630) |
|
2015
| Férée, Hugo, Hainry, Emmanuel, Hoyrup, Mathieu, Péchoux, Romain (2015) Characterizing polynomial time complexity of stream programs using interpretations. Theoretical Computer Science, 585 . pp. 41-54. ISSN 0304-3975. (doi:10.1016/j.tcs.2015.03.008) (KAR id:64982) |
|
2014
| Férée, Hugo, Gomaa, Walid, Hoyrup, Mathieu (2014) Analytical properties of resource-bounded real functionals. Journal of Complexity, 30 (5). pp. 647-671. ISSN 0885-064X. E-ISSN 1090-2708. (doi:10.1016/j.jco.2014.02.008) (KAR id:64714) |
|
2013
| Férée, Hugo, Hoyrup, Mathieu, Gomaa, Walid (2013) On the query complexity of real functionals. In: 28th ACM/IEEE Symposium on Logic in Computer Science. Logic in Computer Science (LICS), 2013 28th Annual IEEE/ACM Symposium on. . pp. 103-112. IEEE ISBN 978-1-4799-0413-6. (doi:10.1109/LICS.2013.15) (KAR id:64996) |
|
2009
| Rowe, Reuben, Férée, Hugo, Thompson, Simon, Owens, Scott (2009) ROTOR: A Tool for Renaming Values in OCaml’s Module System. In: 2019 IEEE/ACM 3rd International Workshop on Refactoring. . IEEE ISBN 978-1-7281-2270-0. (doi:10.1109/IWoR.2019.00013) (KAR id:74129) |
|
