Characterizations of semantic domains for randomized algorithms

DOI10.1007/BF03167919zbMath0679.68151MaRDI QIDQ4729388

Shinichi Yamada

Publication date: 1989

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

zbMATH Keywords

denotational semanticsRandomized algorithmshigh level probabilistic programming languagesrandomized domains

Mathematics Subject Classification ID

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

Cites Work

• Zur schwachen Kompaktheit in Banachverbänden
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Semantics of probabilistic programs
• Concrete representation of abstract (M)-spaces. (A characterization of the space of continuous functions.)
• Data Types as Lattices
• A Powerdomain Construction
• Computational Complexity of Probabilistic Turing Machines
• On perfect measures
• Probabilistic Turing Machines and Computability
• Computability by Probabilistic Turing Machines
• Computability of Recursive Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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