Emmanuel Hainry

Associate Professor at Université de Lorraine and Loria.

Research

Member of Team Mộcqua.

Research in the domain of computations over continuous space and time.

Declassification Policy for Program Complexity Analysis(ACM Library)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, and Romain Péchoux,
LICS ’24: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science.
A Programming Language Characterizing Quantum Polynomial Time(SpringerLink)
Emmanuel Hainry, Romain Péchoux, and Mário Silva,
FoSSaCS 2023, Foundations of Software Science and Computation Structures
Lecture Notes in computer Science, vol. 13992, 2023.
A General Noninterference Policy for Polynomial Time(ACM Library)
Emmanuel Hainry and Romain Péchoux,
P0PL 2023, 50th ACM SIGPLAN Symposium on Principles of Programming Languages
Proceedings of the ACM on Programming Languages, vol. 7, art. 28, pp. 806–832, 2023.
Complete and tractable machine-independent characterizations of second-order polytime (SpringerLink)
EATCS Award: Best Theory Paper at ETAPS
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, and Romain Péchoux,
FoSSaCS 2022, Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science, vol. 13242, pp. 368-388, 2022.
A tier-based typed programming language characterizing Feasible Functionals (Episciences)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, and Romain Péchoux
Logical Methods in Computer Science, vol 18, issue 1, 2022.