A principal type-scheme of a λ-term is the most general type-scheme for the term. The converse principal type-scheme theorem (J.R. Hindley, *The principal typescheme of an object in combinatory logic, Trans. Amer. Math. Soc.**146* (*1969) 29–60*) states that every type-scheme of a combinatory term is a principal type-scheme of some combinatory term.

This paper shows a simple proof for the theorem in λ-calculus, by constructing an algorithm which transforms a type assignment to a λ-term into a principal type assignment to another λ-term that has the type as its principal type-scheme. The clearness of the algorithm is due to the characterization theorem of principal type-assignment figures. The algorithm is applicable to BCIW-λ-terms as well. Thus a uniform proof is presented for the converse principal type-scheme theorem for general λ-terms and BCIW-λ-terms.