Search Result for "cpo":

The Free On-line Dictionary of Computing (30 December 2018):

complete partial ordering cpo (cpo) A partial ordering of a set under a relation, 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 cpo which is algebraic and boundedly complete is a (Scott) domain. (1994-11-30)