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 …

Many extensions of rough sets have been trying to seek appropriate granular structures,
such as neighborhood systems, disjoint intervals and coverings. However, few of them …

We give a domain-theoretic semantics to a statistical programming language, using the plain
old category of dcpos, in contrast to some more sophisticated recent proposals. Remarkably …

Monads prove to be useful mathematical tools in theoretical computer science, notably in
denoting different effects of programming languages. In this paper, we investigate a type of …

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 …

We give a construction of the free dcpo-cone over any dcpo. There are two steps for getting
this result. Firstly, we extend the notion of power domain to directed spaces which are …

Abstract Linear/non-linear (LNL) models, as described by Benton, soundly model a LNL
term calculus and LNL logic closely related to intuitionistic linear logic. Every such model …