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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
