6 problems

Let $\mathrm{NLSPL}$ be the extension of the stabiliser programming language with arbitrary classical operations, and let $c$ and $d$ be well-formed judgements in $\mathrm{NLSPL}$.…

The paper develops a denotational semantics for stabiliser quantum programs and considers the equivalence relation induced by the set of measurement outcomes that can occur. Full-a…

Let $\Lambda$ be over the base structure $\mathfrak{B}_1$, and let $den^*_1$ be a denotation relative to $\Lambda$ such that, for some operational symbol $\phi$ of $\Lambda$,…

An operational type is a specification of the premises and conclusion of a rule together with the domains and co-domains governing its discharged assumptions. Let…

Let $A$ be a set of atoms, let $b$ be a test, and let $\mathsf{SGKAT}$ be the cyclic proof system for Guarded Kleene Algebra with Tests described in the paper. Let…

The paper studies a call-by-value setting in which execution time is measured by the number of ${\beta_v}$-steps leading to a normal form, if any, using a relational denotational s…