8 papers
Quantum Term Rewrite Systems: Applications to Complexity Analysis
Kostia Chardonnet, Emmanuel Hainry, Romain Péchoux +1
Term Rewrite Systems (TRS) is a computational model offering a level of abstraction well-suited towards static analysis, e.g., termination or complexity analyses. In this paper, we…
Approximation theory for distant Bang calculus
Kostia Chardonnet, Jules Chouquet, Axel Kerinec
Approximation semantics capture the observable behaviour of λ-terms, with Böhm Trees and Taylor Expansion standing as two central paradigms. Although conceptually different, thes…
Compiling Quantum Lambda-Terms into Circuits via the Geometry of Interaction
Kostia Chardonnet, Ugo Dal Lago, Naohiko Hoshino +1
We present an algorithm turning any term of a linear quantum -calculus into a quantum circuit. The essential ingredient behind the proposed algorithm is Girard's geometry of in…
Resource-Aware Quantum Programming with General Recursion and Quantum Control
Kostia Chardonnet, Emmanuel Hainry, Romain Péchoux +2
This paper introduces the hybrid quantum language with general recursion , driven towards resource-analysis. By design, does not require the specif…
The Tensor-Plus Calculus
Kostia Chardonnet, Marc de Visme, Benoît Valiron +1
We propose a graphical language that accommodates two monoidal structures: a multiplicative one for pairing and an additional one for branching. In this colored PROP, whether wires…
A Curry-Howard Correspondence for Linear, Reversible Computation
Kostia Chardonnet, Alexis Saurin, Benoît Valiron
In this paper, we present a linear and reversible programming language with inductives types and recursion. The semantics of the languages is based on pattern-matching; we show how…