E-LIB Suche - Ergebnisse für: Férée, Hugo

1

Formalizing and Computing Propositional Quantifiers:

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

Férée, Hugo ; van Gool, Sam - p. 148-158 , 2023

Link: https://dl.acm.org/doi/1..

2

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

, In: Proceedings of the 3rd International Workshop on Refactoring,

Rowe, Reuben N. S. ; Férée, Hugo ; Thompson, Simon J.. - p. 27-30 , 2019

Link: https://dl.acm.org/doi/1..

3

Characterising renaming within OCaml's module system: theor..:

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

Rowe, Reuben N. S. ; Férée, Hugo ; Thompson, Simon J.. - p. 950-965 , 2019

Link: https://dl.acm.org/doi/1..

4

Program Verification in the Presence of I/O: Semantics, Ver..:

, In: Lecture Notes in Computer Science; Verified Software. Theories, Tools, and Experiments,

Férée, Hugo ; Åman Pohjola, Johannes ; Kumar, Ramana... - p. 88-111 , 2018

Link: https://doi.org/10.1007/..

5

Formal proof of polynomial-time complexity with quasi-inter..:

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

Férée, Hugo ; Hym, Samuel ; Mayero, Micaela.. - p. 146-157 , 2018

Link: https://dl.acm.org/doi/1..

6

Game semantics approach to higher-order complexity:

Férée, Hugo
Journal of Computer and System Sciences. 87 (2017) - p. 1-15 , 2017

Link: https://doi.org/10.1016/..

7

Characterizing polynomial time complexity of stream program..:

Férée, Hugo ; Hainry, Emmanuel ; Hoyrup, Mathieu.
Theoretical Computer Science. 585 (2015) - p. 41-54 , 2015

Link: https://doi.org/10.1016/..

8

Analytical properties of resource-bounded real functionals:

Férée, Hugo ; Gomaa, Walid ; Hoyrup, Mathieu
Journal of Complexity. 30 (2014) 5 - p. 647-671 , 2014

Link: https://doi.org/10.1016/..

9

On the Query Complexity of Real Functionals:

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

Feree, Hugo ; Hoyrup, Mathieu ; Gomaa, Walid - p. 103-112 , 2013

Link: https://dl.acm.org/doi/1..

10

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

Rowe, Reuben ; Férée, Hugo ; Thompson, Simon.
https://rhul.elsevierpure.com/en/publications/0efaf95c-f0b6-4c6f-905e-2dc8e0f5066c. , 2019

Link: https://rhul.elsevierpur..

11

ROTOR:A Tool for Renaming Values in OCaml's Module System:

Rowe, Reuben ; Férée, Hugo ; Thompson, Simon.
https://rhul.elsevierpure.com/en/publications/bdb8dd89-aa9a-4543-b42f-aa7096a495cf. , 2019

Link: https://rhul.elsevierpur..

12

Characterizing polynomial time complexity of stream program..:

Férée, Hugo ; Hainry, Emmanuel ; Hoyrup, Mathieu.
https://kar.kent.ac.uk/64982/11/polynomial_stream.pdf. , 2015

Link: https://kar.kent.ac.uk/6..

13

Characterizing polynomial time complexity of stream program..:

Férée, Hugo ; Hainry, Emmanuel ; Hoyrup, Mathieu.
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.tcs.2015.03.008. , 2015

Link: https://inria.hal.scienc..

14

Characterizing polynomial time complexity of stream program..:

Férée, Hugo ; Hainry, Emmanuel ; Hoyrup, Mathieu.
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.tcs.2015.03.008. , 2015

Link: https://inria.hal.scienc..

15

Characterizing polynomial time complexity of stream program..:

Férée, Hugo ; Hainry, Emmanuel ; Hoyrup, Mathieu.
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.tcs.2015.03.008. , 2015

Link: https://hal.inria.fr/hal..