Try Our Apps


Supposedly vs. Supposably

complete partial ordering

complete partial ordering in Technology
(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.
The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source

Word of the Day

Word Value for complete

Scrabble Words With Friends