| 释义 |
complete partial ordering complete partial ordering (theory)(cpo) A partial ordering of a set under arelation, where all directed subsets have a least upper bound. A cpo is usually defined to include a least element,bottom (David Schmidt calls this a pointed cpo). A cpowhich is algebraic and boundedly complete is a (Scott)domain. |