Finding a denotational semantics for higher order quantum computation is a long-standing
problem in the semantics of quantum programming languages. Most past approaches to this …

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 …

In this paper, we propose an approach to quantum λ-calculi. The 'quantum data-classical
control'paradigm is considered. Starting from a measurement-free untyped quantum λ …

While much of the current study on quantum computation employs low-level formalisms such
as quantum circuits, several high-level languages/calculi have been recently proposed …

While much of the current study on quantum computation employs low-level formalisms such
as quantum circuits, several high-level languages/calculi have been recently proposed …

Abstract qPCF is a paradigmatic quantum programming language that extends PCF with
quantum circuits and a quantum co-processor. Quantum circuits are treated as classical data …

We propose qPCF, a functional language able to define and manipulate quantum circuits in
an easy and intuitive way. qPCF follows the tradition of “quantum data & classical control” …

In this paper we present two flavors of a quantum extension to the lambda calculus. The first
one, λ _ ρ λ ρ, follows the approach of classical control/quantum data, where the quantum …

Abstract The Distributed Temporal Logic DTL allows one to reason about temporal
properties of a distributed system from the local point of view of the system's agents, which …

Driven by the interest of reasoning about probabilistic programming languages, we set out to
study a notion of uniqueness of normal forms for them. To provide a tractable proof method …