18 citations · 80 across the 12 of their papers we have counts for
13 papers
The Central Valuations Monad
Xiaodong Jia, Michael Mislove, Vladimir Zamdzhiev
We give a commutative valuations monad Z on the category DCPO of dcpo's and Scott-continuous functions. Compared to the commutative valuations monads given in [Jia et al., 2021], o…
Quantum CPOs
Andre Kornell, Bert Lindenhovius, Michael Mislove
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 enriched over th…
Semantics for Variational Quantum Programming
Xiaodong Jia, Andre Kornell, Bert Lindenhovius +2
We consider a programming language that can manipulate both classical and quantum information. Our language is type-safe and designed for variational quantum programming, which is…
Commutative Monads for Probabilistic Programming Languages
Xiaodong Jia, Bert Lindenhovius, Michael Mislove +1
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 this…
A category of quantum posets
Andre Kornell, Bert Lindenhovius, Michael Mislove
We investigate a category of quantum posets that generalizes the category of posets and monotone functions. Up to equivalence, its objects are hereditarily atomic von Neumann algeb…
Completing Simple Valuations in K-categories
Xiaodong Jia, Michael Mislove
We prove that Keimel and Lawson's K-completion Kc of the simple valuation monad Vs defines a monad Kc o Vs on each K-category A. We also characterize the Eilenberg-Moore algebras o…
LNL-FPC: The Linear/Non-linear Fixpoint Calculus
Bert Lindenhovius, Michael Mislove, Vladimir Zamdzhiev
We describe a type system with mixed linear and non-linear recursive types called LNL-FPC (the linear/non-linear fixpoint calculus). The type system supports linear typing, which e…
Domains and Stochastic Processes
Michael Mislove
Domain theory has a long history of applications in theoretical computer science and mathematics. In this article, we explore the relation of domain theory to probability theory an…
Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams
Bert Lindenhovius, Michael Mislove, Vladimir Zamdzhiev
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 induces a c…
Domains and Random Variables
Michael W. Mislove
The aim of this paper is to establish a theory of random variables on domains. Domain theory is a fundamental component of theoretical computer science, providing mathematical mode…
From Haar to Lebesgue via Domain Theory, Revised version
Will Brian, Michael Mislove
If denotes the Cantor set realized as the infinite product of two-point groups, then a folklore result says the Cantor map from in…
Every compact group can have a non-measurable subgroup
W. R. Brian, M. W. Mislove
We show that it is consistent with ZFC that every compact group has a non-Haar-measurable subgroup. In addition, we demonstrate a natural construction, and we conjecture that this…
Probabilistic Monads, Domains and Classical Information
Michael Mislove
Shannon's classical information theory uses probability theory to analyze channels as mechanisms for information flow. In this paper, we generalize results of Martin, Allwein and M…