scientific article; zbMATH DE number 1231645

MaRDI QIDQ4222969zbMATH OpenFDO

Authors Achim Jung, Regina Tix

Publication date 6 January 1999

Full work available at URL http://www.elsevier.com/cas/tree/store/tcs/free/entcs/store/contents.htt?jrnl=tcs&sctn=entcs&mode=sub&vol=13#13008

zbMATH Keywords

continuous domains

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• QRB-domains and the probabilistic powerdomain
• Probabilistic power domains, information systems, and locales
• The probabilistic powerdomain from a topological viewpoint
• A note on probabilistic powerdomains
• scientific article; zbMATH DE number 4050957

Cited in

(38)

• Domain theory, testing and simulation for labelled Markov processes
• A denotational semantics for low-level probabilistic programs with nondeterminism
• Discrete random variables over domains
• On the computational content of the Lawson topology
• Least upper bounds for probability measures and their applications to abstractions
• Semi-decidability of may, must and probabilistic testing in a higher-type setting
• A convenient category of domains
• QRB-domains and the probabilistic powerdomain
• scientific article; zbMATH DE number 6712178 (Why is no real title available?)
• On higher-order probabilistic subrecursion
• A Probabilistic Applied Pi–Calculus
• scientific article; zbMATH DE number 3947603 (Why is no real title available?)
• scientific article; zbMATH DE number 4050957 (Why is no real title available?)
• Probabilistic call by push value
• scientific article; zbMATH DE number 2086644 (Why is no real title available?)
• Stably compact spaces and closed relations
• Continuous domain theory in logical form
• Anatomy of a domain of continuous random variables. II
• Linear Structures for Concurrency in Probabilistic Programming Languages
• A note on probabilistic powerdomains
• On higher-order probabilistic subrecursion
• The geometry of Bayesian programming
• On the termination problem for probabilistic higher-order recursive programs
• Probabilistic stable functions on discrete cones are power series
• Probabilistic completion of nondeterministic models
• From Haar to Lebesgue via domain theory
• A short proof of the Schröder-Simpson theorem
• Probabilistic power domains, information systems, and locales
• Characterising FS domains by means of power domains
• (Towards a) statistical probabilistic lazy lambda calculus
• The probabilistic powerdomain from a topological viewpoint
• Solvability in a probabilistic setting (invited talk)
• A dichotomy result for countably based sober spaces
• A domain-theoretic approach to statistical programming languages
• The probabilistic powerdomain for stably compact spaces
• A bifinite domain based on closed circular rings
• Topological cones: functional analysis in a \(T_{0}\)-setting
• Comparing free algebras in topological and classical domain theory

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 Q4222969)