Abstract
Various closure properties of a domain theoretic construction for a probabilistic domain are considered. N. Saheb-Sjahromi's probabilistic domain construction is extended to non-algebraic domains, particularly RSFP objects. An abstract notion of a probabilistic domain is presented and the construction is shown to be free. Issues of computability and approaches to solving domain equations in probabilistic domains are addressed briefly.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
