scientific article; zbMATH DE number 4179422
From MaRDI portal
Publication:3203061
monadrecursive domain equationscategory of continuous partial ordersmeta-language for programming languages with probabilistic featuresmodel for Moggi's computational lambda-calculuspartial order of continuous [0,1-valued evaluations on the Scott topology]probabilistic powerdomain construction on the category of inductively complete partial orderssemantics of a language with a probabilistic parallel construct
Recommendations
Cited in
(only showing first 100 items - show all)- Algebra for quantitative information flow
- Simple types for probabilistic termination
- Convexity and order in probabilistic call-by-name FPC
- A domain equation for bisimulation
- Algebras of the extended probabilistic powerdomain monad
- Bimonoidal structure of probability monads
- Measure and probability for concurrency theorists
- Probabilistic communicating processes
- Linking theories in probabilistic programming
- Computable exchangeable sequences have computable de Finetti measures
- scientific article; zbMATH DE number 3947603 (Why is no real title available?)
- A convenient category of domains
- scientific article; zbMATH DE number 4050957 (Why is no real title available?)
- Stochastic order on metric spaces and the ordered Kantorovich monad
- scientific article; zbMATH DE number 2086644 (Why is no real title available?)
- On the Taylor expansion of probabilistic λ-terms
- Separating minimal valuations, point-continuous valuations, and continuous valuations
- Power diagram detection with applications to information elicitation
- Program algebra for quantitative information flow
- Probabilistic completion of nondeterministic models
- Conditioning in probabilistic programming
- A hierarchy of quantum semantics
- Coproducts of Ideal Monads
- Generative Datalog and answer set programming (extended abstract)
- Eilenberg--Moore algebras for stochastic relations
- Measure transformer semantics for Bayesian machine learning
- Free complete Wasserstein algebras
- The generalized Riemann integral on locally compact spaces
- Synthetic topology in Homotopy Type Theory for probabilistic programming
- Distributed probabilistic and quantum strategies
- Healthiness conditions for predicate transformers
- Semantics of probabilistic programs: a weak limit approach
- A Cartesian closed category for random variables
- Linear Structures for Concurrency in Probabilistic Programming Languages
- A dichotomy result for countably based sober spaces
- Algebraic theory of probabilistic and nondeterministic processes.
- Observationally-induced lower and upper powerspace constructions
- A construction of free dcpo-cones
- Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
- Metrics for labelled Markov processes
- Monoids over domains
- Weightable quasi-metric semigroups and semilattices
- A mathematical theory of randomized computation. I
- Reasoning about probabilistic sequential programs
- Compositional abstraction for stochastic systems
- A computational model for metric spaces
- Products and projective limits of continuous valuations on \(T_0\) spaces
- An application of computable distributions to the semantics of probabilistic programming languages
- Classical control, quantum circuits and linear logic in enriched category theory
- Topological cones: functional analysis in a \(T_{0}\)-setting
- Domain theory and integration
- The probabilistic powerdomain for stably compact spaces
- Kleisli morphisms and randomized congruences for the Giry monad
- Metric reasoning about -terms: the general case
- Probabilistic weak simulation is decidable in polynomial time
- Discrete Lawvere theories and computational effects
- On the termination problem for probabilistic higher-order recursive programs
- Approximating labelled Markov processes
- A characterization of partial metrizability: Domains are quantifiable.
- On local compactness of spaces of continuous valuations
- The uniform measure of simple regular sets of infinite trees
- Proof rules for the correctness of quantum programs
- Refinement-oriented probability for CSP
- The monad of probability measures over compact ordered spaces and its Eilenberg-Moore algebras
- The correspondence between partial metrics and semivaluations
- Towards a quantum calculus (work in progress, extended abstract)
- A type theory for probabilistic and Bayesian reasoning
- Theory and Applications of Models of Computation
- Complete positivity and natural representation of quantum computations
- Program equivalence in a typed probabilistic call-by-need functional language
- On applicative similarity, sequentiality, and full abstraction
- The way-below relation of function spaces over semantic domains
- A domain-theoretic approach to statistical programming languages
- Probabilistic and quantum event structures
- Probability, valuations, hyperspace: three monads on Top and the support as a morphism
- The expectation monad in quantum foundations
- All Cartesian closed categories of quasicontinuous domains consist of domains
- A topologically enriched probability monad on the Cartesian closed category of CGWH spaces
- Codensity and the Giry monad
- Categories of timed stochastic relations
- (Towards a) statistical probabilistic lazy lambda calculus
- Structure in machine learning
- Continuous R-valuations
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Bisimulation for probabilistic transition systems: a coalgebraic approach
- Functional distribution monads in functional-analytic contexts
- Information systems for continuous posets
- Computing measures of weak-mso definable sets of trees
- Probabilistic power domains, information systems, and locales
- Proper maps and quasi-adjoints
- Domain semantics of possibility computations
- Domain equations for probabilistic processes
- Finitary monads on the category of posets
- Proofs of randomized algorithms in Coq
- True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures
- Combining effects: sum and tensor
- Probabilistic concurrent constraint programming
- Approximating and computing behavioural distances in probabilistic transition systems
- Probabilistic event structures and domains
- Riemann and Edalat integration on domains.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3203061)
