The collection of isomorphism classes of nitely generated rank-ordered sets is shown to be a nitely generated rank-ordered set again. This is used to construct a model of the simply typed lambda calculus extended by the assumption Type: Type. Beside this, the structure of rank-ordered sets is studied. They can be represented as inverse limits of !-cochains of substructures, each being a retract...