7 citations · 15 across the 5 of their papers we have counts for
8 papers
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…
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…
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…
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…
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…