We consider profunctors f : P |−→Q between posets and introduce their graph and ascent. The profunctors Pro(P, Q) form themselves a poset, and we consider a partition I F of this into a down-set I and up-set F, called a ...