Emmanuel Hainry

44 papers A* 3B 8C 6Misc 1Journal 24Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
A Polytime Quantum Programming Language.
ACM Trans. Quantum Comput.
Emmanuel Hainry, Romain Péchoux, Mário Silva
2025 B conf
Branch Sequentialization in Quantum Polytime.
FSCD
Emmanuel Hainry, Romain Péchoux, Mário Silva
2025 J jnl
Complete and tractable machine-independent characterizations of second-order polytime.
Log. Methods Comput. Sci.
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2025 J jnl
Expectation-based Analysis of Higher-Order Quantum Programs.
CoRR
Martin Avanzini, Alejandro Díaz-Caro, Emmanuel Hainry, Romain Péchoux
2025 B conf
Quantum Programming in Polylogarithmic Time.
MFCS
Florent Ferrari, Emmanuel Hainry, Romain Péchoux, Mário Silva
2025 J jnl
Quantum Programming in Polylogarithmic Time.
CoRR
Florent Ferrari, Emmanuel Hainry, Romain Péchoux, Mário Silva
2025 J jnl
Resource-Aware Hybrid Quantum Programming with General Recursion and Quantum Control.
CoRR
Kostia Chardonnet, Emmanuel Hainry, Romain Péchoux, Thomas Vinet
2024 J jnl
Branch Sequentialization in Quantum Polytime.
CoRR
Emmanuel Hainry, Romain Péchoux, Mário Alberto Machado da Silva
2024 A* conf
Declassification Policy for Program Complexity Analysis.
LICS
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2024 J jnl
Declassification Policy for Program Complexity Analysis.
CoRR
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2023 J jnl
A General Noninterference Policy for Polynomial Time.
Proc. ACM Program. Lang.
Emmanuel Hainry, Romain Péchoux
2023 B conf
A Programming Language Characterizing Quantum Polynomial Time.
FoSSaCS
Emmanuel Hainry, Romain Péchoux, Mário Silva
2023 J jnl
A feasible and unitary programming language with quantum control.
CoRR
Alejandro Díaz-Caro, Emmanuel Hainry, Romain Péchoux, Mário Silva
2022 J jnl
A programming language characterizing quantum polynomial time.
CoRR
Emmanuel Hainry, Romain Péchoux, Mário Silva
2022 J jnl
A tier-based typed programming language characterizing Feasible Functionals.
Log. Methods Comput. Sci.
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2022 B conf
Complete and tractable machine-independent characterizations of second-order polytime.
FoSSaCS
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2022 J jnl
Complete and tractable machine-independent characterizations of second-order polytime.
CoRR
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2021 J jnl
A tier-based typed programming language characterizing Feasible Functionals.
CoRR
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2021 C conf
ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs.
ICTAC
Emmanuel Hainry, Emmanuel Jeandel, Romain Péchoux, Olivier Zeyen
2020 A* conf
A tier-based typed programming language characterizing Feasible Functionals.
LICS
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2020 Misc conf
Polynomial Time over the Reals with Parsimony.
FLOPS
Emmanuel Hainry, Damiano Mazza, Romain Péchoux
2020 J jnl
Theory of higher order interpretations and application to Basic Feasible Functions.
Log. Methods Comput. Sci.
Emmanuel Hainry, Romain Péchoux
2018 J jnl
A Type-Based Complexity Analysis of Object Oriented Programs.
CoRR
Emmanuel Hainry, Romain Péchoux
2018 J jnl
A type-based complexity analysis of Object Oriented programs.
Inf. Comput.
Emmanuel Hainry, Romain Péchoux
2018 J jnl
Theory of higher order interpretations and application to Basic Feasible Functions.
CoRR
Emmanuel Hainry, Romain Péchoux
2017 B conf
Higher order interpretation for higher order complexity.
LPAR
Emmanuel Hainry, Romain Péchoux
2016 J jnl
A Framework for Algebraic Characterizations in Recursive Analysis.
CoRR
Olivier Bournez, Walid Gomaa, Emmanuel Hainry
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 B conf
Objects in Polynomial Time.
APLAS
Emmanuel Hainry, Romain Péchoux
2013 J jnl
Computation with perturbed dynamical systems.
J. Comput. Syst. Sci.
Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry
2013 B conf
Type-Based Complexity Analysis for Fork Processes.
FoSSaCS
Emmanuel Hainry, Jean-Yves Marion, Romain Péchoux
2011 J jnl
Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions.
Int. J. Unconv. Comput.
Olivier Bournez, Walid Gomaa, Emmanuel Hainry
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
2010 B conf
Robust Computations with Dynamical Systems.
MFCS
Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry
2008 C conf
Computing Omega-Limit Sets in Linear Dynamical Systems.
UC
Emmanuel Hainry
2008 C conf
Reachability in Linear Dynamical Systems.
CiE
Emmanuel Hainry
2007 C conf
On the Computational Capabilities of Several Models.
MCU
Olivier Bournez, Emmanuel Hainry
2007 J jnl
Polynomial differential equations compute all real computable functions on computable compact intervals.
J. Complex.
Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graça, Emmanuel Hainry
2006 — —
Modèles de calcul sur les réels, résultats de comparaison. (Computation on the reals.Comparison of some models).
Emmanuel Hainry
2006 J jnl
Recursive Analysis Characterized as a Class of Real Recursive Functions.
Fundam. Informaticae
Olivier Bournez, Emmanuel Hainry
2006 C conf
The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation.
TAMC
Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graça, Emmanuel Hainry
2005 J jnl
Elementarily computable functions over the real numbers and R-sub-recursive functions.
Theor. Comput. Sci.
Olivier Bournez, Emmanuel Hainry
2004 A* conf
An Analog Characterization of Elementarily Computable Functions over the Real Numbers.
ICALP
Olivier Bournez, Emmanuel Hainry
2004 C conf
Real Recursive Functions and Real Extensions of Recursive Functions.
MCU
Olivier Bournez, Emmanuel Hainry