19 citations · 23 across the 5 of their papers we have counts for
5 papers
Splitting recursion schemes into reversible and classical interacting threads
Armando B. Matos, Luca Paolini, Luca Roversi
Given a simple recursive function, we show how to extract from it a reversible and an classical iterative part. Those parts can synchronously cooperate under a Producer/Consumer pa…
QPCF: higher order languages and quantum circuits
Luca Paolini, Mauro Piccolo, Margherita Zorzi
qPCF is a paradigmatic quantum programming language that ex- tends PCF with quantum circuits and a quantum co-processor. Quantum circuits are treated as classical data that can be…
Quantum Programming Made Easy
Luca Paolini, Luca Roversi, Margherita Zorzi
We present IQu, namely a quantum programming language that extends Reynold's Idealized Algol, the paradigmatic core of Algol-like languages. IQu combines imperative programming wit…
Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus
Giulio Guerrieri, Luca Paolini, Simona Ronchi Della Rocca
We study an extension of Plotkin's call-by-value lambda-calculus via two commutation rules (sigma-reductions). These commutation rules are sufficient to remove harmful call-by-valu…
Proceedings Sixth Workshop on Intersection Types and Related Systems
Stéphane Graham-Lengrand, Luca Paolini
This volume contains the proceedings of the Sixth Workshop on Intersection Types and Related Systems (ITRS 2012). The workshop was held in Dubrovnik (Croatia) on June 29th, 2012, a…