Emmanuel Hainry
44
Documents
Affiliations actuelles
- 529408
- 413289
- 206040
Identifiants chercheurs
emmanuel-hainry-
0000-0002-9750-0460
- IdRef : 114622396
Publications
- 6
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 21
- 14
- 5
- 4
- 4
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 4
- 1
- 3
- 2
- 1
- 2
- 4
- 4
- 1
- 2
- 3
- 2
- 2
- 4
- 1
- 4
- 1
- 2
- 2
- 1
- 1
- 1
- 1
- 1
|
|
A General Noninterference Policy for Polynomial TimePOPL 23, Jan 2023, Boston, United States. pp.806 - 832, ⟨10.1145/3571221⟩
Communication dans un congrès
hal-04190355v1
|
|
|
A programming language characterizing quantum polynomial timeFoundations 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⟩
Communication dans un congrès
hal-04190385v1
|
|
|
Complete and tractable machine-independent characterizations of second-order polytimeFoSSaCS 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⟩
Communication dans un congrès
hal-03722245v1
|
|
|
ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java ProgramsICTAC 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⟩
Communication dans un congrès
hal-03337755v1
|
|
|
A tier-based typed programming language characterizing Feasible FunctionalsLICS '20 - 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.535-549, ⟨10.1145/3373718.3394768⟩
Communication dans un congrès
hal-02881308v1
|
|
|
Polynomial time over the reals with parsimonyFLOPS 2020 - International Symposium on Functional and Logic Programming, Apr 2020, Akita, Japan
Communication dans un congrès
hal-02499149v1
|
Tiered complexity at higher orderMLA'2019 - Third Workshop on Mathematical Logic and its Applications, Mar 2019, Nancy, France
Communication dans un congrès
hal-02499348v1
|
|
|
|
Tiered complexity at higher orderDICE-FOPARA 2019 - Joint international workshop on Developments in Implicit Computational complExity and Foundational and Practical Aspects of Resource Analysis, Apr 2019, Praha, Czech Republic
Communication dans un congrès
hal-02499318v1
|
|
|
Higher-order interpretations for higher-order complexityLPAR 2017 - International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, Geoff Sutcliffe, May 2017, Maun, Botswana. pp.269-285
Communication dans un congrès
hal-01529170v2
|
|
|
Higher order interpretations for higher order complexity8th Workshop on Developments in Implicit Computational complExity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, Apr 2017, Uppsala, Sweden
Communication dans un congrès
hal-01653659v1
|
Implicit computational complexity in Object Oriented ProgramsDICE 2015 - Developments in Implicit Computational Complexity, Apr 2015, London, United Kingdom
Communication dans un congrès
hal-01207918v1
|
|
Higher order interpretations for Basic Feasible FunctionsDICE 2015 - Developments in Implicit Computational Complexity, Apr 2015, London, United Kingdom
Communication dans un congrès
hal-01207910v1
|
|
|
|
Objects in Polynomial TimeAPLAS 2015, Nov 2015, Pohang, South Korea. pp.387--404, ⟨10.1007/978-3-319-26529-2_21⟩
Communication dans un congrès
hal-01206161v1
|
|
|
Types for controlling heap and stack in JavaThird International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA), Ugo Dal Lago and Ricardo Pena, Aug 2013, Bertinoro, Italy
Communication dans un congrès
hal-00910166v1
|
|
|
Type-based complexity analysis for fork processes16th 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⟩
Communication dans un congrès
hal-00755450v2
|
|
|
Interpretation of stream programs: characterizing type 2 polynomial time complexity21st International Symposium on Algorithms and Computation - ISAAC 2010, Dec 2010, Jeju Island, South Korea
Communication dans un congrès
inria-00518381v1
|
|
|
Robust computations with dynamical systems35th 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⟩
Communication dans un congrès
inria-00522029v1
|
|
|
Implicit complexity in recursive analysisTenth International Workshop on Logic and Computational Complexity - LCC'09, Aug 2009, Los Angeles, United States
Communication dans un congrès
inria-00429964v1
|
|
|
Computing omega-limit Sets in Linear Dynamical SystemsUnconventional Computation, Aug 2008, Vienne, Austria. pp.83--95, ⟨10.1007/978-3-540-85194-3_9⟩
Communication dans un congrès
inria-00250111v3
|
|
|
Reachability in linear dynamical systemsComputability in Europe, Jun 2008, Athènes, Greece. pp.241-250, ⟨10.1007/978-3-540-69407-6_28⟩
Communication dans un congrès
inria-00202674v2
|
On the Computational Capabilities of Several Models5th International Conference on Machines, Computations and Universality - MCU 2007, Sep 2007, Orléans, France. pp.12-23
Communication dans un congrès
inria-00182738v1
|
|
The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation3rd International Conference on Theory and Applications of Models of Computation - TAMC'2006, 2006, Pekin/Chine
Communication dans un congrès
inria-00102946v1
|
|
Real Recursive Functions and Real Extensions of Recursive FunctionsMachines and Universal Computations - MCU'2004, 2004, Saint-Petersburg, Russia, 12 p
Communication dans un congrès
inria-00100053v1
|
|
An analog Characterization of Elementarily Computable Functions Over the Real Numbers31st International Colloqiuim on Automata, Languages and Programming - ICALP'2004, 2004, Turku, Finland, pp.269-280
Communication dans un congrès
inria-00100054v1
|
|
An analog Characterization of Elementarily Computable Functions Over the Real Numbers2nd APPSEM II Workshop - APPSEM'2004, 2004, Tallinn, Estonia, 12 p
Communication dans un congrès
inria-00099897v1
|
|
|
Modèles de calcul sur les réels, résultats de comparaisonAutre [cs.OH]. Institut National Polytechnique de Lorraine - INPL, 2006. Français. ⟨NNT : ⟩
Thèse
tel-00142675v1
|
|
|
Modèles de calcul sur les réels, résultats de comparaisonAutre [cs.OH]. Institut National Polytechnique de Lorraine, 2006. Français. ⟨NNT : 2006INPL090N⟩
Thèse
tel-01752781v1
|
|
|
An imperative programming language characterizing FBQPPoster de conférence hal-03895106v1 |
|
|
Type-based heap and stack space analysis in Java2013
Autre publication scientifique
hal-00773141v4
|
|
|
A feasible and unitary quantum programming language2024
Pré-publication, Document de travail
hal-04266203v3
|
|
|
A programming language characterizing quantum polynomial time2022
Pré-publication, Document de travail
hal-03895081v1
|
|
|
Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions[Research Report] 2009
Rapport
inria-00421561v1
|
|
|
Decidability and Undecidability in Dynamical Systems[Research Report] 2009, pp.27
Rapport
inria-00429965v1
|
|
|
Elementarily Computable Functions Over the Real Numbers and $\mathbb{R}$-Sub-Recursive Functions[Intern report] A04-R-301 || bournez04f, 2004, 22 p
Rapport
inria-00107812v1
|
Fonctions réelles calculables et fonctions R-récursives[Stage] A03-R-347 || hainry03a, 2003, 30 p
Rapport
inria-00099502v1
|