Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Péchoux, Romain"'
In automated complexity analysis, noninterference-based type systems statically guarantee, via soundness, the property that well-typed programs compute functions of a given complexity class, e.g., the class FP of functions computable in polynomial ti
Externí odkaz:
http://arxiv.org/abs/2401.14957
In this paper, we study quantitative properties of quantum programs. Properties of interest include (positive) almost-sure termination, expected runtime or expected cost, that is, for example, the expected number of applications of a given quantum ga
Externí odkaz:
http://arxiv.org/abs/2312.13657
We introduce a novel quantum programming language featuring higher-order programs and quantum controlflow which ensures that all qubit transformations are unitary. Our language boasts a type system guaranteeingboth unitarity and polynomial-time norma
Externí odkaz:
http://arxiv.org/abs/2311.01054
We introduce a first-order quantum programming language, named FOQ, whose terminating programs are reversible. We restrict FOQ to a strict and tractable subset, named PFOQ, of terminating programs with bounded width, that provides a first programming
Externí odkaz:
http://arxiv.org/abs/2212.06656
The class of Basic Feasible Functionals BFF is the second-order counterpart of the class of first-order functions computable in polynomial time. We present several implicit characterizations of BFF based on a typed programming language of terms. Thes
Externí odkaz:
http://arxiv.org/abs/2208.14739
We introduce a new kind of expectation transformer for a mixed classical-quantum programming language. Our semantic approach relies on a new notion of a cost structure, which we introduce and which can be seen as a specialisation of the Kegelspitzen
Externí odkaz:
http://arxiv.org/abs/2201.09361
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 1 (February 24, 2022) lmcs:7216
The class of Basic Feasible Functionals BFF$_2$ is the type-2 counterpart of the class FP of type-1 functions computable in polynomial time. Several characterizations have been suggested in the literature, but none of these present a programming lang
Externí odkaz:
http://arxiv.org/abs/2102.11605
Inductive datatypes in programming languages allow users to define useful data structures such as natural numbers, lists, trees, and others. In this paper we show how inductive datatypes may be added to the quantum programming language QPL. We constr
Externí odkaz:
http://arxiv.org/abs/1910.09633
Autor:
Hainry, Emmanuel, Péchoux, Romain
A type system is introduced for a generic Object Oriented programming language in order to infer resource upper bounds. A sound andcomplete characterization of the set of polynomial time computable functions is obtained. As a consequence, the heap-sp
Externí odkaz:
http://arxiv.org/abs/1802.06653
Autor:
Hainry, Emmanuel, Péchoux, Romain
Publikováno v:
Logical Methods in Computer Science, Volume 16, Issue 4 (December 14, 2020) lmcs:4237
Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional language. We
Externí odkaz:
http://arxiv.org/abs/1801.08350