A long-standing open problem in the semantics of programming languages supporting
probabilistic choice is to find a commutative monad for probability on the category DCPO. In …

Selinger gave a superoperator model of a first-order quantum programming language and
proved that it is fully definable and hence fully abstract. This paper proposes an extension of …

We consider a programming language that can manipulate both classical and quantum
information. Our language is type-safe and designed for variational quantum programming …

We introduce the monoidal closed category qCPO of quantum cpos, whose objects are"
quantized" analogs of omega-complete partial orders (cpos). The category qCPO is …

Building on the theory of quantum posets, we introduce a non-commutative version of
suplattices, ie, complete lattices whose morphisms are supremum-preserving maps, which …

This thesis revolves around an area of computer science called" semantics". We work with
operational semantics, equational theories, and denotational semantics. The first …

This paper unites two research lines. The first involves finding categorical models of
quantum programming languages and their type systems. The second line concerns the …

A compact T-algebra is an initial T-algebra whose inverse is a final T-coalgebra. Functors
with this property are said to be algebraically compact. This is a very strong property used in …

Substructural type systems, such as affine (and linear) type systems, are type systems which
impose restrictions on copying (and discarding) of variables, and they have found many …

After an extended hiatus, the Semantics column is returning with this issue of the Newsletter.
The subject of this quarter's column is Call-By-Push-Value, written by Paul B. Levy. CBPV is …