We define a notion of type assignment with polymorphic intersection types of rank 2 for a term graph rewriting language that expresses sharing and cycles. We show that type assignment is decidable through defining, using the extended notion of unification from [Bakel-Barbanera-Fernandez-Types'00], a notion of principal pair which generalizes ML's principal type property.
