This Mizar paper presents the definition of a "Preordered Coherent Space" (PCS). Furthermore, the paper defines a number of operations on PCS's and states and proves a number of elementary lemmas about these operations. PCS's have many useful properties which could qualify them for mathematical study in their own right. PCS's were invented, however, to construct Scott domains, to solve domain equations, and to construct models of various versions of lambda calculus.
For more on PCS's, see . The present Mizar paper defines the operations on PCS's used in Chapter 8 of .
If the inline PDF is not rendering correctly, you can download the PDF file here.
 Grzegorz Bancerek. König's theorem. Formalized Mathematics 1(3):589-593 1990.
 Grzegorz Bancerek. The "way-below" relation. Formalized Mathematics 6(1):169-176 1997.
 Chantal Berline and Klaus Grue. A kappa-denotational semantics for map theory in ZFC + SI. Theoretical Computer Science 179(1-2):137-202 1997.
 Czesław Byliński. Functions and their basic properties. Formalized Mathematics 1(1):55-65 1990.
 Czesław Byliński. The modification of a function by a function and the iteration of the composition of a function. Formalized Mathematics 1(3):521-527 1990.