@InProceedings{jung08a,
author = {A. Jung and M. A. Moshier and S. J. Vickers},
title = {Presenting dcpos and dcpo algebras},
booktitle = {Proceedings of the 24th Conference on the Mathematical Foundations of Programming Semantics},
editor = {A. Bauer and M. Mislove},
series = {Electronic Notes in Theoretical Computer Science},
year = 2008,
volume = 218,
pages = {209--229},
publisher = {Elsevier Science Publishers {B.V.}},
doi = {10.1016/j.entcs.2008.10.013},
abstract = {Dcpos can be presented by preorders of generators
and inequational relations expressed as covers.
Algebraic operations on the generators (possibly
with their results being ideals of generators) can
be extended to the dcpo presented, provided the
covers are “stable” for the operations. The
resulting dcpo algebra has a natural universal
characterization and satisfies all the inequational
laws satisfied by the generating algebra.
Applications include known “coverage theorems” from
locale theory.}
}