We introduce the LOv-calculus, a graphical language for reasoning about linear optical
quantum circuits with so-called vacuum state auxiliary inputs. We present the axiomatics of …

Quantum programming languages permit a hardware independent, high-level description of
quantum algo rithms. In particular, the quantum lambda-calculus is a higher-order …

The overall purpose of the present work is to lay the foundations for a new approach to
bridge logic and probabilistic computation. To this aim we introduce extensions of classical …

We introduce two extensions of the λ-calculus with a probabilistic choice operator, Λ⊕ cbv
and Λ⊕ cbn, modeling respectively call-by-value and call-by-name probabilistic …

While recent progress in quantum hardware open the door for significant speedup in certain
key areas (cryptography, biology, chemistry, optimization, machine learning, etc), quantum …

This paper revisits the Interaction Abstract Machine (IAM), a machine based on Girard's
Geometry of Interaction, introduced by Mackie and Danos & Regnier. It is an unusual …

Decomposing Probabilistic Lambda-Calculi. Page 150 Decomposing Probabilistic Lambda-Calculi
Ugo Dal Lago1, Giulio Guerrieri2 (), and Willem Heijltjes2 1 Dipartimento di Informatica-Scienza …

We introduce a multi-token machine for Idealized Parallel Algol (IPA), a higher-order
concurrent programming language with shared state and semaphores. Our machine takes …

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 …

We describe categorical models of a circuit-based (quantum) functional programming
language. We show that enriched categories play a crucial role. Following earlier work on …