Access content directly

Emmanuel Hainry

44
Documents
Current affiliations
  • 529408
  • 413289
  • 206040
Researcher identifiers

Publications

Image document

A tier-based typed programming language characterizing Feasible Functionals

Emmanuel Hainry , Bruce Kapron , Jean-Yves Marion , Romain Péchoux
Logical Methods in Computer Science, 2022, 18 (1), pp.31. ⟨10.46298/LMCS-18(1:33)2022⟩
Journal articles hal-03722168v1
Image document

Theory of Higher Order Interpretations and Application to Basic Feasible Functions

Emmanuel Hainry , Romain Péchoux
Logical Methods in Computer Science, 2020, 16 (4), pp.25. ⟨10.23638/LMCS-16(4:14)2020⟩
Journal articles hal-02499206v2
Image document

A Type-Based Complexity Analysis of Object Oriented Programs

Emmanuel Hainry , Romain Péchoux
Information and Computation, 2018, Information and Computation, 261 (1), pp.78-115. ⟨10.1016/j.ic.2018.05.006⟩
Journal articles hal-01712506v1
Image document

Characterizing polynomial time complexity of stream programs using interpretations

Hugo Férée , Emmanuel Hainry , Mathieu Hoyrup , Romain Péchoux
Theoretical Computer Science, 2015, 585, pp.41-54. ⟨10.1016/j.tcs.2015.03.008⟩
Journal articles hal-01112160v1
Image document

Computation with perturbed dynamical systems

Olivier Bournez , Daniel Graça , Emmanuel Hainry
Journal of Computer and System Sciences, 2013, 79 (5), pp.714-724. ⟨10.1016/j.jcss.2013.01.025⟩
Journal articles hal-00643634v2
Image document

Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions

Olivier Bournez , Walid Gomaa , Emmanuel Hainry
International Journal of Unconventional Computing, 2011, 7 (5), pp.331-351
Journal articles hal-00644361v1
Image document

Polynomial differential equations compute all real computable functions on computable compact intervals

Olivier Bournez , Manuel L. Campagnolo , Daniel S. Graça , Emmanuel Hainry
Journal of Complexity, 2007, 23 (3), pp.317--335
Journal articles inria-00102947v2

Recursive Analysis Characterized as a Class of Real Recursive Functions

Olivier Bournez , Emmanuel Hainry
Fundamenta Informaticae, 2006, 74 (4), pp.409-433
Journal articles inria-00000515v1

Elementarily Computable Functions Over the Real Numbers and R-Sub-Recursive Functions

Olivier Bournez , Emmanuel Hainry
Theoretical Computer Science, 2005, 348 (2-3), pp.130--147. ⟨10.1016/j.tcs.2005.09.010⟩
Journal articles inria-00000518v1
Image document

A General Noninterference Policy for Polynomial Time

Emmanuel Hainry , Romain Péchoux
POPL 23, Jan 2023, Boston, United States. pp.806 - 832, ⟨10.1145/3571221⟩
Conference papers hal-04190355v1
Image document

A programming language characterizing quantum polynomial time

Emmanuel Hainry , Romain Péchoux , Mário Silva
Foundations of Software Science and Computation Structures - 26th International Conference, FoSSaCS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, {ETAPS} 2023, Paris, France, April 22-27, 2023, Proceedings, Apr 2023, Paris, France. ⟨10.1007/978-3-031-30829-1\_8⟩
Conference papers hal-04190385v1
Image document

Complete and tractable machine-independent characterizations of second-order polytime

Emmanuel Hainry , Bruce M Kapron , Jean-Yves Marion , Romain Péchoux
FoSSaCS 2022 - 25th International Conference on Foundations of Software Science and Computation Structures, Apr 2022, Munich, Germany. pp.368-388, ⟨10.1007/978-3-030-99253-8_19⟩
Conference papers hal-03722245v1
Image document

ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs

Emmanuel Hainry , Emmanuel Jeandel , Romain Péchoux , Olivier Zeyen
ICTAC 2021 - 18th International Colloquium on Theoretical Aspects of Computing, Sep 2021, Nur-Sultan/Virtual, Kazakhstan. pp.357-365, ⟨10.1007/978-3-030-85315-0_20⟩
Conference papers hal-03337755v1
Image document

Polynomial time over the reals with parsimony

Emmanuel Hainry , Damiano Mazza , Romain Péchoux
FLOPS 2020 - International Symposium on Functional and Logic Programming, Apr 2020, Akita, Japan
Conference papers hal-02499149v1
Image document

A tier-based typed programming language characterizing Feasible Functionals

Emmanuel Hainry , Bruce Kapron , Jean-Yves Marion , Romain Péchoux
LICS '20 - 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.535-549, ⟨10.1145/3373718.3394768⟩
Conference papers hal-02881308v1

Tiered complexity at higher order

Emmanuel Hainry , Bruce Kapron , Jean-Yves Marion , Romain Péchoux
MLA'2019 - Third Workshop on Mathematical Logic and its Applications, Mar 2019, Nancy, France
Conference papers hal-02499348v1
Image document

Tiered complexity at higher order

Emmanuel Hainry , Bruce Kapron , Jean-Yves Marion , Romain Péchoux
DICE-FOPARA 2019 - Joint international workshop on Developments in Implicit Computational complExity and Foundational and Practical Aspects of Resource Analysis, Apr 2019, Praha, Czech Republic
Conference papers hal-02499318v1
Image document

Higher order interpretations for higher order complexity

Emmanuel Hainry , Romain Péchoux
8th Workshop on Developments in Implicit Computational complExity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, Apr 2017, Uppsala, Sweden
Conference papers hal-01653659v1
Image document

Higher-order interpretations for higher-order complexity

Emmanuel Hainry , Romain Péchoux
LPAR 2017 - International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, Geoff Sutcliffe, May 2017, Maun, Botswana. pp.269-285
Conference papers hal-01529170v2

Higher order interpretations for Basic Feasible Functions

Emmanuel Hainry , Romain Péchoux
DICE 2015 - Developments in Implicit Computational Complexity, Apr 2015, London, United Kingdom
Conference papers hal-01207910v1
Image document

Objects in Polynomial Time

Emmanuel Hainry , Romain Péchoux
APLAS 2015, Nov 2015, Pohang, South Korea. pp.387--404, ⟨10.1007/978-3-319-26529-2_21⟩
Conference papers hal-01206161v1

Implicit computational complexity in Object Oriented Programs

Emmanuel Hainry , Romain Péchoux
DICE 2015 - Developments in Implicit Computational Complexity, Apr 2015, London, United Kingdom
Conference papers hal-01207918v1
Image document

Type-based complexity analysis for fork processes

Emmanuel Hainry , Jean-Yves Marion , Romain Péchoux
16th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), Mar 2013, Rome, Italy. pp.305-320, ⟨10.1007/978-3-642-37075-5_20⟩
Conference papers hal-00755450v2
Image document

Types for controlling heap and stack in Java

Emmanuel Hainry , Romain Péchoux
Third International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA), Ugo Dal Lago and Ricardo Pena, Aug 2013, Bertinoro, Italy
Conference papers hal-00910166v1
Image document

Interpretation of stream programs: characterizing type 2 polynomial time complexity

Hugo Férée , Emmanuel Hainry , Mathieu Hoyrup , Romain Péchoux
21st International Symposium on Algorithms and Computation - ISAAC 2010, Dec 2010, Jeju Island, South Korea
Conference papers inria-00518381v1
Image document

Robust computations with dynamical systems

Olivier Bournez , Daniel Graça , Emmanuel Hainry
35th international symposium on Mathematical Foundations of Computer Science - MFCS 2010, Aug 2010, Brno, Czech Republic. pp.198-208, ⟨10.1007/978-3-642-15155-2_19⟩
Conference papers inria-00522029v1
Image document

Implicit complexity in recursive analysis

Olivier Bournez , Walid Gomaa , Emmanuel Hainry
Tenth International Workshop on Logic and Computational Complexity - LCC'09, Aug 2009, Los Angeles, United States
Conference papers inria-00429964v1
Image document

Reachability in linear dynamical systems

Emmanuel Hainry
Computability in Europe, Jun 2008, Athènes, Greece. pp.241-250, ⟨10.1007/978-3-540-69407-6_28⟩
Conference papers inria-00202674v2
Image document

Computing omega-limit Sets in Linear Dynamical Systems

Emmanuel Hainry
Unconventional Computation, Aug 2008, Vienne, Austria. pp.83--95, ⟨10.1007/978-3-540-85194-3_9⟩
Conference papers inria-00250111v3

On the Computational Capabilities of Several Models

Olivier Bournez , Emmanuel Hainry
5th International Conference on Machines, Computations and Universality - MCU 2007, Sep 2007, Orléans, France. pp.12-23
Conference papers inria-00182738v1

The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation

Olivier Bournez , Manuel Lameiras Campagnolo , Daniel S. Graça , Emmanuel Hainry
3rd International Conference on Theory and Applications of Models of Computation - TAMC'2006, 2006, Pekin/Chine
Conference papers inria-00102946v1

An analog Characterization of Elementarily Computable Functions Over the Real Numbers

Olivier Bournez , Emmanuel Hainry
2nd APPSEM II Workshop - APPSEM'2004, 2004, Tallinn, Estonia, 12 p
Conference papers inria-00099897v1

Real Recursive Functions and Real Extensions of Recursive Functions

Olivier Bournez , Emmanuel Hainry
Machines and Universal Computations - MCU'2004, 2004, Saint-Petersburg, Russia, 12 p
Conference papers inria-00100053v1

An analog Characterization of Elementarily Computable Functions Over the Real Numbers

Olivier Bournez , Emmanuel Hainry
31st International Colloqiuim on Automata, Languages and Programming - ICALP'2004, 2004, Turku, Finland, pp.269-280
Conference papers inria-00100054v1
Image document

Modèles de calcul sur les réels, résultats de comparaison

Emmanuel Hainry
Autre [cs.OH]. Institut National Polytechnique de Lorraine, 2006. Français. ⟨NNT : 2006INPL090N⟩
Theses tel-01752781v1
Image document

Modèles de calcul sur les réels, résultats de comparaison

Emmanuel Hainry
Autre [cs.OH]. Institut National Polytechnique de Lorraine - INPL, 2006. Français. ⟨NNT : ⟩
Theses tel-00142675v1
Image document

An imperative programming language characterizing FBQP

Emmanuel Hainry , Romain Péchoux , Mário Silva
QPL 2022 - Quantum Physics and Logic, Jun 2022, Oxford, United Kingdom.
Conference poster hal-03895106v1