scientific article; zbMATH DE number 4179422
From MaRDI portal
Publication:3203061
category of continuous partial ordersmeta-language for programming languages with probabilistic featuresmodel for Moggi's computational lambda-calculusmonadpartial order of continuous [0,1-valued evaluations on the Scott topology]probabilistic powerdomain construction on the category of inductively complete partial ordersrecursive domain equationssemantics of a language with a probabilistic parallel construct
Recommendations
Cited in
(only showing first 100 items - show all)- Probabilistic weak simulation is decidable in polynomial time
- Domain semantics of possibility computations
- A mathematical theory of randomized computation. I
- A computational model for metric spaces
- Quantitative semantics, topology, and possibility measures
- The generalized Riemann integral on locally compact spaces
- The way-below relation of function spaces over semantic domains
- Computation on metric spaces via domain theory
- Approximating labelled Markov processes
- Algebraic theory of probabilistic and nondeterministic processes.
- Riemann and Edalat integration on domains.
- A characterization of partial metrizability: Domains are quantifiable.
- Measure and probability for concurrency theorists
- Functional distribution monads in functional-analytic contexts
- From probability monads to commutative effectuses
- Effectuses from monads
- The correspondence between partial metrics and semivaluations
- Extension of valuations on locally compact sober spaces
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Linking theories in probabilistic programming
- The uniform measure of simple regular sets of infinite trees
- Domain-complete and LCS-complete spaces
- Algebras of the extended probabilistic powerdomain monad
- A denotational semantics for low-level probabilistic programs with nondeterminism
- Bimonoidal structure of probability monads
- Completing simple valuations in K-categories
- Presenting de Groot duality of stably compact spaces
- Consistent Smyth powerdomains.
- Stochastic order on metric spaces and the ordered Kantorovich monad
- All Cartesian closed categories of quasicontinuous domains consist of domains
- Refinement-oriented probability for CSP
- Information systems for continuous posets
- Reasoning about probabilistic sequential programs
- The monad of probability measures over compact ordered spaces and its Eilenberg-Moore algebras
- Comparative branching-time semantics for Markov chains
- Consistent Smyth powerdomains of topological spaces and quasicontinuous domains
- A domain-theoretic approach to Brownian motion and general continuous stochastic processes
- Power diagram detection with applications to information elicitation
- Program algebra for quantitative information flow
- Proof rules for the correctness of quantum programs
- True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures
- Combining effects: sum and tensor
- Probabilistic event structures and domains
- Approximating and computing behavioural distances in probabilistic transition systems
- Complete positivity and natural representation of quantum computations
- A domain equation for bisimulation
- Distributed probabilistic and quantum strategies
- Kantorovich-Rubinstein quasi-metrics. I: Spaces of measures and of continuous valuations
- Domain equations for probabilistic processes
- An application of computable distributions to the semantics of probabilistic programming languages
- Categories of timed stochastic relations
- Probabilistic observations and valuations (extended abstract)
- A convenient category of domains
- Remarks on testing probabilistic processes
- The category theoretic understanding of universal algebra: Lawvere theories and monads
- A hierarchy of quantum semantics
- Towards a quantum calculus (work in progress, extended abstract)
- Probabilistic operational semantics for the lambda calculus
- Semantics of probabilistic programs: a weak limit approach
- Metric reasoning about -terms: the general case
- The expectation monad in quantum foundations
- On applicative similarity, sequentiality, and full abstraction
- Computable exchangeable sequences have computable de Finetti measures
- Compositional abstraction for stochastic systems
- scientific article; zbMATH DE number 3902043 (Why is no real title available?)
- scientific article; zbMATH DE number 3947603 (Why is no real title available?)
- scientific article; zbMATH DE number 4050957 (Why is no real title available?)
- scientific article; zbMATH DE number 1231591 (Why is no real title available?)
- Bisimulation for probabilistic transition systems: a coalgebraic approach
- A type theory for probabilistic and Bayesian reasoning
- Coproducts of Ideal Monads
- Free complete Wasserstein algebras
- scientific article; zbMATH DE number 2086644 (Why is no real title available?)
- Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases
- Semantics for algebraic operations
- Continuous domain theory in logical form
- Linear Structures for Concurrency in Probabilistic Programming Languages
- Weightable quasi-metric semigroups and semilattices
- Observationally-induced lower and upper powerspace constructions
- scientific article; zbMATH DE number 1456958 (Why is no real title available?)
- Synthetic topology in Homotopy Type Theory for probabilistic programming
- Finitary monads on the category of posets
- Separating minimal valuations, point-continuous valuations, and continuous valuations
- Probability, valuations, hyperspace: three monads on Top and the support as a morphism
- On the Taylor expansion of probabilistic λ-terms
- Classical control, quantum circuits and linear logic in enriched category theory
- On the termination problem for probabilistic higher-order recursive programs
- Convexity and order in probabilistic call-by-name FPC
- Products and projective limits of continuous valuations on \(T_0\) spaces
- Probabilistic completion of nondeterministic models
- Algebra for quantitative information flow
- Probabilistic and quantum event structures
- Monoids over domains
- Probabilistic power domains, information systems, and locales
- Measure transformer semantics for Bayesian machine learning
- Theory and Applications of Models of Computation
- Characterising FS domains by means of power domains
- Metrics for labelled Markov processes
- Conditioning in probabilistic programming
- Healthiness conditions for predicate transformers
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)
