Characterizations of semantic domains for randomized algorithms

DOI10.1007/BF03167919MaRDI QIDQ4729388zbMATH OpenFDO

Authors Shinichi Yamada

Publication date 1989

Published in Japan Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF03167919

zbMATH Keywords

denotational semanticsRandomized algorithmshigh level probabilistic programming languagesrandomized domains

Mathematics Subject Classification ID

Stochastic programming (90C15) Semantics in the theory of computing (68Q55)

Recommendations

• A mathematical theory of randomized computation. I
• A mathematical theory of randomized computation. II
• Semantic domains for combining probability and non-determinism
• scientific article; zbMATH DE number 1456958
• A monad for randomized algorithms

Cites work

• scientific article; zbMATH DE number 3822417 (Why is no real title available?)
• scientific article; zbMATH DE number 3937874 (Why is no real title available?)
• scientific article; zbMATH DE number 3947603 (Why is no real title available?)
• scientific article; zbMATH DE number 3959364 (Why is no real title available?)
• scientific article; zbMATH DE number 3706504 (Why is no real title available?)
• scientific article; zbMATH DE number 3793435 (Why is no real title available?)
• scientific article; zbMATH DE number 3464348 (Why is no real title available?)
• scientific article; zbMATH DE number 3467467 (Why is no real title available?)
• scientific article; zbMATH DE number 3429561 (Why is no real title available?)
• scientific article; zbMATH DE number 3245885 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3365842 (Why is no real title available?)
• scientific article; zbMATH DE number 3090543 (Why is no real title available?)
• A Powerdomain Construction
• Computability by Probabilistic Turing Machines
• Computability of Recursive Functions
• Computational Complexity of Probabilistic Turing Machines
• Concrete representation of abstract (M)-spaces. (A characterization of the space of continuous functions.)
• Data Types as Lattices
• On perfect measures
• Probabilistic Turing Machines and Computability
• Semantics of probabilistic programs
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Zur schwachen Kompaktheit in Banachverbänden

Cited in

(2)

• A mathematical theory of randomized computation. I
• A mathematical theory of randomized computation. II

This page was built for publication: Characterizations of semantic domains for randomized algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4729388)