E-LIB Suche - Ergebnisse für: Péchoux, Romain

1

On the Hardness of Analyzing Quantum Programs Quantitativel:

, In: Programming Languages and Systems; Lecture Notes in Computer Science,

Avanzini, Martin ; Moser, Georg ; Péchoux, Romain. - p. 31-58 , 2024

Link: https://doi.org/10.1007/..

2

Declassification Policy for Program Complexity Analysis:

, In: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science,

Hainry, Emmanuel ; Kapron, Bruce ; Marion, Jean-Yves. - p. 1-14 , 2024

Link: https://dl.acm.org/doi/1..

3

A Programming Language Characterizing Quantum Polynomial Ti..:

, In: Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures,

Hainry, Emmanuel ; Péchoux, Romain ; Silva, Mário - p. 156-175 , 2023

Link: https://doi.org/10.1007/..

4

A General Noninterference Policy for Polynomial Time:

Hainry, Emmanuel ; Péchoux, Romain
Proceedings of the ACM on Programming Languages. 7 (2023) POPL - p. 806-832 , 2023

Link: https://doi.org/10.1145/..

5

Quantum Expectation Transformers for Cost Analysis:

, In: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science,

Avanzini, Martin ; Moser, Georg ; Pechoux, Romain.. - p. 1-13 , 2022

Link: https://dl.acm.org/doi/1..

6

Complete and tractable machine-independent characterization..:

, In: Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures,

Hainry, Emmanuel ; Kapron, Bruce M. ; Marion, Jean-Yves. - p. 368-388 , 2022

Link: https://doi.org/10.1007/..

7

A tier-based typed programming language characterizing Feas..:

Hainry, Emmanuel ; Kapron, Bruce M. ; Marion, Jean-Yves.
Logical Methods in Computer Science. 18, Issue 1 (2022) - p. , 2022

Link: https://doi.org/10.46298..

8

ComplexityParser: An Automatic Tool for Certifying Poly-Tim..:

, In: Theoretical Aspects of Computing – ICTAC 2021; Lecture Notes in Computer Science,

Hainry, Emmanuel ; Jeandel, Emmanuel ; Péchoux, Romain. - p. 357-365 , 2021

Link: https://doi.org/10.1007/..

9

Quantum Programming with Inductive Datatypes: Causality and..:

, In: Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures,

Péchoux, Romain ; Perdrix, Simon ; Rennela, Mathys. - p. 562-581 , 2020

Link: https://doi.org/10.1007/..

10

Polynomial Time over the Reals with Parsimony:

, In: Functional and Logic Programming; Lecture Notes in Computer Science,

Hainry, Emmanuel ; Mazza, Damiano ; Péchoux, Romain - p. 50-65 , 2020

Link: https://doi.org/10.1007/..

11

On the efficiency of normal form systems for representing B..:

Couceiro, Miguel ; Lehtonen, Erkko ; Mercuriali, Pierre.
Theoretical Computer Science. 813 (2020) - p. 341-361 , 2020

Link: https://doi.org/10.1016/..

12

A tier-based typed programming language characterizing Feas..:

, In: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science,

Hainry, Emmanuel ; Kapron, Bruce M. ; Marion, Jean-Yves. - p. 535-549 , 2020

Link: https://dl.acm.org/doi/1..

13

A type-based complexity analysis of Object Oriented program:

Hainry, Emmanuel ; Péchoux, Romain
Information and Computation. 261 (2018) - p. 78-115 , 2018

Link: https://doi.org/10.1016/..

14

Algebras and coalgebras in the light affine Lambda calculus:

, In: Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming,

Gaboardi, Marco ; Péchoux, Romain - p. 114-126 , 2015

Link: https://dl.acm.org/doi/1..

15

Characterizing polynomial time complexity of stream program..:

Férée, Hugo ; Hainry, Emmanuel ; Hoyrup, Mathieu.
Theoretical Computer Science. 585 (2015) - p. 41-54 , 2015

Link: https://doi.org/10.1016/..