2 citations · 4 across the 2 of their papers we have counts for
4 papers
Generating reversible circuits from higher-order functional programs
Benoit Valiron
Boolean reversible circuits are boolean circuits made of reversible elementary gates. Despite their constrained form, they can simulate any boolean function. The synthesis and vali…
Parallelism and Synchronization in an Infinitary Context (Long Version)
Ugo Dal Lago, Claudia Faggian, Benoit Valiron +1
We study multitoken interaction machines in the context of a very expressive logical system with exponentials, fixpoints and synchronization. The advantage of such machines is to p…
A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract)
Peter Selinger, Benoît Valiron
We give a categorical semantics for a call-by-value linear lambda calculus. Such a lambda calculus was used by Selinger and Valiron as the backbone of a functional programming lang…
A lambda calculus for quantum computation with classical control
Peter Selinger, Benoit Valiron
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the first…