相关论文: QRB-Domains and the Probabilistic Powerdomain

The probabilistic powerdomain $\mathbf V X$ on a space $X$ is the space of all continuous valuations on $X$. We show that, for every quasi-continuous domain $X$, $\mathbf V X$ is again a quasi-continuous domain, and that the Scott and weak…

We present a novel, yet rather simple construction within the traditional framework of Scott domains to provide semantics to probabilistic programming, thus obtaining a solution to a long-standing open problem in this area. Unlike current…

There is no known way of giving a domain-theoretic semantics to higher-order probabilistic languages, in such a way that the involved domains are continuous or quasi-continuous - the latter is required to do any serious mathematics. We…

Probabilistic powerdomain in domain theory plays an important role in modeling the semantics of nondeterministic functional programming languages with probabilistic choice. In this paper, we extend the notion of powerdomain to directed…

We give an adequate denotational semantics for languages with recursive higher-order types, continuous probability distributions, and soft constraints. These are expressive languages for building Bayesian models of the kinds used in…

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…

A folklore result in category theory is that a (weakly) Cartesian closed category with finite co-products is distributive. Usually, the proof of this small result is carried on using the fact that the exponential functor is right adjoint to…

Normann proved that the domains of the game model of PCF (the domains of sequential functionals) need not be dcpos. Sazonov has defined natural domains for a theory of such incomplete domains. This paper further develops that theory. It…

The behavior of factorization properties in various ring extensions is a central theme in commutative algebra. Classically, the UFDs are (completely) integrally closed and tend to behave well in standard ring extensions, with the notable…

Higher-order probabilistic programming languages allow programmers to write sophisticated models in machine learning and statistics in a succinct and structured way, but step outside the standard measure-theoretic formalization of…

The well-quasi-orders (WQO) play an important role in various fields such as Computer Science, Logic or Graph Theory. Since the class of WQOs lacks closure under some important operations, the proof that a certain quasi-order is WQO…

We show that a confluent case of the big q-Jacobi polynomials P_n(x;a,b,c;q), which corresponds to a=b=-c, leads to a discrete orthogonality relation for imaginary values of the parameter a (outside of its commonly known domain 0<a<…

We point out that a sequence of natural numbers is the dimension sequence of a subproduct system if and only if it is the cardinality sequence of a word system (or factorial language). Determining such sequences is, therefore, reduced to a…

It is well known that strict $\omega$-categories, strict $\omega$-functors, strict natural $\omega$-transformations, and so on, form a strict $\omega$-category. A similar property for weak $\omega$-categories is one of the main hypotheses…

Every CSP(B) for a finite structure B is either in P or it is NP-complete but the proofs of the finite-domain CSP dichotomy by Andrei Bulatov and Dimitryi Zhuk not only show the computational complexity separation but also confirm the…

We extend the Luzin hierarchy of qcb$_0$-spaces introduced in [ScS13] to all countable ordinals, obtaining in this way the hyperprojective hierarchy of qcb$_0$-spaces. We generalize all main results of [ScS13] to this larger hierarchy. In…

The closure of chains of embedding-projection pairs (ep-pairs) under bilimits in some categories of predomains and domains is standard and well-known. For instance, Scott's $D_\infty$ construction is well-known to produce directed bilimits…

The problem of determining whether a probabilistic program terminates almost surely (i.e.~with probability one) is undecidable, and actually $\Pi^0_2$-complete. For this reason, a growing literature has explored classes of programs for…

Directed spaces are natural topological extensions of dcpos in domain theory and form a cartesian closed category. We will show that the D-completion of free algebras over a Scott space $\Sigma L$, on the context of directed spaces, are…

In this article the notions of (quasi weakly hereditary) general closure operator $\mb{C}$ on a category $\cx$ with respect to a class $\cm$ of morphisms, and quasi factorization structures in a category $\cx$ are introduced. It is shown…