Emmanuel Hainry
21
Documents
Affiliations actuelles
- 529408
- 413289
- 206040
Identifiants chercheurs
- emmanuel-hainry
- 0000-0002-9750-0460
- IdRef : 114622396
Publications
- 3
- 3
- 3
- 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
- 21
- 5
- 4
- 4
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 4
- 3
- 2
- 1
- 1
- 3
- 3
- 1
- 2
- 1
|
A tier-based typed programming language characterizing Feasible FunctionalsLogical Methods in Computer Science, 2022, 18 (1), pp.31. ⟨10.46298/LMCS-18(1:33)2022⟩
Article dans une revue
hal-03722168v1
|
|
Theory of Higher Order Interpretations and Application to Basic Feasible FunctionsLogical Methods in Computer Science, 2020, 16 (4), pp.25. ⟨10.23638/LMCS-16(4:14)2020⟩
Article dans une revue
hal-02499206v2
|
|
A Type-Based Complexity Analysis of Object Oriented ProgramsInformation and Computation, 2018, Information and Computation, 261 (1), pp.78-115. ⟨10.1016/j.ic.2018.05.006⟩
Article dans une revue
hal-01712506v1
|
|
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
|
|
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
|
|
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
|
|
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
|
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
|
|
|
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
|
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
|
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
|
|
|
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
|
|
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
|