Zobrazeno 1 - 10
of 156
pro vyhledávání: '"Mislove, Michael"'
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 program of quantization of mathematical structures, which amounts to finding non
Externí odkaz:
http://arxiv.org/abs/2406.01816
Publikováno v:
In Proceedings CALCO 2021 (Early Ideas Track)
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], our new monad Z is larger and it contains all push-forward images of va
Externí odkaz:
http://arxiv.org/abs/2111.10873
Publikováno v:
EPTCS 340, 2021, pp. 174-187
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 the category CPO of cpos, and contains both CPO, and the opposite of the
Externí odkaz:
http://arxiv.org/abs/2109.02196
Publikováno v:
Proc. ACM Program. Lang. 6, POPL, Article 26 (January 2022)
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 a hybrid classical-quantum computational paradigm. The classical subsy
Externí odkaz:
http://arxiv.org/abs/2107.13347
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 paper we present three such monads and a general construction for find
Externí odkaz:
http://arxiv.org/abs/2102.00510
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 algebras equipped with quantum partial orders in Weaver's sense. We show th
Externí odkaz:
http://arxiv.org/abs/2101.11184
Autor:
Jia, Xiaodong, Mislove, Michael
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 of Kc o Vs as the weakly locally convex K-cones, and its algebra morphi
Externí odkaz:
http://arxiv.org/abs/2002.01865
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 2 (April 22, 2021) lmcs:5703
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 enhances the safety properties of programs, but also supports non-linea
Externí odkaz:
http://arxiv.org/abs/1906.09503
Autor:
Mislove, Michael
Publikováno v:
Theoretical Computer Science, Volume 807, 6 February 2020, Pages 284-297
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 and stochastic processes. The goal is to establish a theory in which Pol
Externí odkaz:
http://arxiv.org/abs/1807.00884
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 canonical enrichment that we show soundly models a LNL lambda calculus
Externí odkaz:
http://arxiv.org/abs/1804.09822