On stable domains (Q685428)

In denotational semantics of programming languages, various categories of domains, with continuous functions as morphisms, and their closure properties under operations like taking products or function space have been intensively studied. However, classes of domains which, like bifinite domains, are also closed under the Plotkin powerdomain operation are rare. The author investigates stable domains. They naturally generalize the concept of \(dI\)-domains studied by Berry and others and satisfy a strong finiteness condition for compact elements, but in general no distributivity assumption. The author shows that the class of all stable domains is closed under countable cartesian products, stable function space and the Plotkin powerdomain operation. As a consequence, he also obtains that the categories of all stable \(L\)-domains and of all distributive stable \(L\)-domains, with stable functions as morphisms, are cartesian closed.