Some Consistent Power Constructions
Logic in Computer Science
2025-03-11 v1
Abstract
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: exists whenever there exists a which is greater than and . 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.
Cite
@article{arxiv.2503.06036,
title = {Some Consistent Power Constructions},
author = {Chengyu Zhou and Qingguo Li},
journal= {arXiv preprint arXiv:2503.06036},
year = {2025}
}