A characterization of plotkin's order in powerdomains, and some of its properties

D.Frutos Escrig
1984 Theoretical Computer Science  
In 1976, Plotkln introduced powerdomains adapting to them, in some sense, Egli-Milner's order. L.ately, Sm$h ( 1978) presented the same results starting from generating trees. and adding a new order that he denoted by E (,. He also gave a characterization of the first order c". without making any further use of it. This characterization turned out to be wrong, and sta-ting from 1i1i7 fact (which shall be proved in the sequel) I have developed a new one (which is the salne as the one that has
more » ... n exposed by Plotkin, although it lo , been got from another approach), obtaining in sdme cases a canGcn 1 r,:presentative of the equivalence classes induced by the preorder c ". As it would be expected, this representative is maximal with respect to the s-order. Nevertheless, in uther cases such a canonical 'representative' would not be finitely generable, and some consequences of it will be exposed.
doi:10.1016/0304-3975(84)90127-0 fatcat:hv74fjnxerg75dxgal4zpauicm