Emmanuel Hainry
- Designing the Future of Computational Models (MOCQUA)
Publications
Publications
|
|
Quantum Programming in Polylogarithmic TimeMathematical Foundations of Computer Science 2025, Aug 2025, Varsovie, Poland. ⟨10.4230/LIPIcs.MFCS.2025.47⟩ |
|
|
Branch Sequentialization in Quantum PolytimeFSCD 2025, Jul 2025, Birmingham, United Kingdom. ⟨10.4230/LIPIcs.FSCD.2025.22⟩ |
|
|
Declassification Policy for Program Complexity AnalysisLICS '24: 39th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2024, Tallinn Estonia, France. pp.1-14, ⟨10.1145/3661814.3662100⟩ |
|
|
A General Noninterference Policy for Polynomial TimePOPL 23, Jan 2023, Boston, United States. pp.806 - 832, ⟨10.1145/3571221⟩ |
|
|
A programming language characterizing quantum polynomial timeFOSSACS 2023 - 26th International Conference on Foundations of Software Science and Computational Structures, Orna Kupferman; Pawel Sobocinski, Apr 2023, Paris, France. pp.156-175, ⟨10.1007/978-3-031-30829-1_8⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
Polynomial time over the reals with parsimonyFLOPS 2020 - International Symposium on Functional and Logic Programming, Apr 2020, Akita, Japan |
Tiered complexity at higher orderMLA'2019 - Third Workshop on Mathematical Logic and its Applications, Mar 2019, Nancy, France |
|
|
|
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 |
|
|
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 |
|
|
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 |
Implicit computational complexity in Object Oriented ProgramsDICE 2015 - Developments in Implicit Computational Complexity, Apr 2015, London, United Kingdom |
|
Higher order interpretations for Basic Feasible FunctionsDICE 2015 - Developments in Implicit Computational Complexity, Apr 2015, London, United Kingdom |
|
|
|
Objects in Polynomial TimeAPLAS 2015, Nov 2015, Pohang, South Korea. pp.387--404, ⟨10.1007/978-3-319-26529-2_21⟩ |
|
|
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 |
|
|
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⟩ |
|
|
Interpretation of stream programs: characterizing type 2 polynomial time complexity21st International Symposium on Algorithms and Computation - ISAAC 2010, Dec 2010, Jeju Island, South Korea |
|
|
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⟩ |
|
|
Implicit complexity in recursive analysisTenth International Workshop on Logic and Computational Complexity - LCC'09, Aug 2009, Los Angeles, United States |
|
|
Computing omega-limit Sets in Linear Dynamical SystemsUnconventional Computation, Aug 2008, Vienne, Austria. pp.83--95, ⟨10.1007/978-3-540-85194-3_9⟩ |
|
|
Reachability in linear dynamical systemsComputability in Europe, Jun 2008, Athènes, Greece. pp.241-250, ⟨10.1007/978-3-540-69407-6_28⟩ |
On the Computational Capabilities of Several Models5th International Conference on Machines, Computations and Universality - MCU 2007, Sep 2007, Orléans, France. pp.12-23 |
|
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 |
|
Real Recursive Functions and Real Extensions of Recursive FunctionsMachines and Universal Computations - MCU'2004, 2004, Saint-Petersburg, Russia, 12 p |
|
An analog Characterization of Elementarily Computable Functions Over the Real Numbers2nd APPSEM II Workshop - APPSEM'2004, 2004, Tallinn, Estonia, 12 p |
|
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 |
|
|
Modèles de calcul sur les réels, résultats de comparaisonInformatique [cs]. Institut National Polytechnique de Lorraine - INPL, 2006. Français. ⟨NNT : ⟩ |
|
|
Modèles de calcul sur les réels, résultats de comparaisonAutre [cs.OH]. Institut National Polytechnique de Lorraine, 2006. Français. ⟨NNT : 2006INPL090N⟩ |
|
|
An imperative programming language characterizing FBQPQPL 2022 - Quantum Physics and Logic, Jun 2022, Oxford, United Kingdom. |
|
|
Type-based heap and stack space analysis in Java2013 |
|
|
Resource-Aware Quantum Programming with General Recursion and Quantum Control2026 |
|
|
A feasible and unitary quantum programming language2024 |
|
|
Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions[Research Report] 2009 |
|
|
Decidability and Undecidability in Dynamical Systems[Research Report] 2009, pp.27 |
|
|
Elementarily Computable Functions Over the Real Numbers and $\mathbb{R}$-Sub-Recursive Functions[Intern report] A04-R-301 || bournez04f, 2004, 22 p |
Fonctions réelles calculables et fonctions R-récursives[Stage] A03-R-347 || hainry03a, 2003, 30 p |