scientific article; zbMATH DE number 4179422
From MaRDI portal
zbMATH Open0716.06003MaRDI QIDQ3203061FDOQ3203061
Authors:
Publication date: 1989
Full work available at URL: http://homepages.inf.ed.ac.uk/gdp/publications/Prob_Powerdomain.pdf
Title of this publication is not available (Why is that?)
Recommendations
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Combinatory logic and lambda calculus (03B40) Continuous lattices and posets, applications (06B35) Semantics in the theory of computing (68Q55)
Cited In (only showing first 100 items - show all)
- Synthetic topology in Homotopy Type Theory for probabilistic programming
- Healthiness conditions for predicate transformers
- Semantics of probabilistic programs: a weak limit approach
- Linear Structures for Concurrency in Probabilistic Programming Languages
- 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
- Products and projective limits of continuous valuations on \(T_0\) spaces
- An application of computable distributions to the semantics of probabilistic programming languages
- On the termination problem for probabilistic higher-order recursive programs
- Towards a quantum calculus (work in progress, extended abstract)
- Program equivalence in a typed probabilistic call-by-need functional language
- Complete positivity and natural representation of quantum computations
- On applicative similarity, sequentiality, and full abstraction
- Probability, valuations, hyperspace: three monads on Top and the support as a morphism
- (Towards a) statistical probabilistic lazy lambda calculus
- Structure in machine learning
- Categories of timed stochastic relations
- Probabilistic power domains, information systems, and locales
- Finitary monads on the category of posets
- Completing simple valuations in K-categories
- Mixed nondeterministic-probabilistic automata: blending graphical probabilistic models with nondeterminism
- Domain-complete and LCS-complete spaces
- Consistent Smyth powerdomains of topological spaces and quasicontinuous domains
- A domain-theoretic approach to Brownian motion and general continuous stochastic processes
- Algebra for quantitative information flow
- Presenting de Groot duality of stably compact spaces
- Convexity and order in probabilistic call-by-name FPC
- Kantorovich-Rubinstein quasi-metrics. I: Spaces of measures and of continuous valuations
- Bimonoidal structure of probability monads
- Linking theories in probabilistic programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Taylor expansion of probabilistic λ-terms
- Separating minimal valuations, point-continuous valuations, and continuous valuations
- Stochastic order on metric spaces and the ordered Kantorovich monad
- Conditioning in probabilistic programming
- Probabilistic completion of nondeterministic models
- Power diagram detection with applications to information elicitation
- Program algebra for quantitative information flow
- Generative Datalog and answer set programming (extended abstract)
- Measure transformer semantics for Bayesian machine learning
- Free complete Wasserstein algebras
- The generalized Riemann integral on locally compact spaces
- Distributed probabilistic and quantum strategies
- Algebraic theory of probabilistic and nondeterministic processes.
- Monoids over domains
- Observationally-induced lower and upper powerspace constructions
- Weightable quasi-metric semigroups and semilattices
- Metrics for labelled Markov processes
- Reasoning about probabilistic sequential programs
- A mathematical theory of randomized computation. I
- Compositional abstraction for stochastic systems
- A computational model for metric spaces
- Metric reasoning about \(\lambda\)-terms: the general case
- Topological cones: functional analysis in a \(T_{0}\)-setting
- Domain theory and integration
- Kleisli morphisms and randomized congruences for the Giry monad
- The probabilistic powerdomain for stably compact spaces
- Probabilistic weak simulation is decidable in polynomial time
- Approximating labelled Markov processes
- Discrete Lawvere theories and computational effects
- A characterization of partial metrizability: Domains are quantifiable.
- 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
- A type theory for probabilistic and Bayesian reasoning
- The correspondence between partial metrics and semivaluations
- Theory and Applications of Models of Computation
- Probabilistic and quantum event structures
- The way-below relation of function spaces over semantic domains
- All Cartesian closed categories of quasicontinuous domains consist of domains
- The expectation monad in quantum foundations
- Bisimulation for probabilistic transition systems: a coalgebraic approach
- Codensity and the Giry monad
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Functional distribution monads in functional-analytic contexts
- Information systems for continuous posets
- Domain equations for probabilistic processes
- Probabilistic concurrent constraint programming
- Domain semantics of possibility computations
- True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures
- Combining effects: sum and tensor
- Approximating and computing behavioural distances in probabilistic transition systems
- Probabilistic event structures and domains
- Proofs of randomized algorithms in Coq
- Riemann and Edalat integration on domains.
- Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases
- Characterising FS domains by means of power domains
- Continuous domain theory in logical form
- Computation on metric spaces via domain theory
- The category theoretic understanding of universal algebra: Lawvere theories and monads
- Probabilistic operational semantics for the lambda calculus
- Remarks on testing probabilistic processes
- Title not available (Why is that?)
- From probability monads to commutative effectuses
- Effectuses from monads
- Extension of valuations on locally compact sober spaces
- Probabilistic observations and valuations (extended abstract)
- A denotational semantics for low-level probabilistic programs with nondeterminism
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)
