Some Consistent Power Constructions
By: Chengyu Zhou, Qingguo Li
Potential Business Impact:
Creates new ways for computers to handle uncertain information.
Consistent Hoare, Smyth and Plotkin power domains are introduced and discussed by Yuan and Kou. The consistent algebraic operation $+$ defined by them is a binary partial Scott continuous operation satisfying the requirement: $a+b$ exists whenever there exists a $c$ which is greater than $a$ and $b$. We extend the consistency to be a categorical concept and obtain an approach to generating consistent monads from monads on dcpos whose images equipped with some algebraic operations. Then we provide two new power constructions over domains: the consistent Plotkin index power domain and the consistent probabilistic power domain. Moreover, we verify these power constructions are free.
Similar Papers
An Adequacy Theorem Between Mixed Powerdomains and Probabilistic Concurrency
Logic in Computer Science
Helps check if computer programs work right.
Initial Algebras of Domains via Quotient Inductive-Inductive Types
Logic in Computer Science
Helps computers understand tricky math rules.
Monotone weak distributive laws over the lifted powerset monad in categories of algebras
Logic in Computer Science
Finds math rules for combining choices.