Recursive Types in System F

Using the notion of recursive type from Mendler's second-order lambda-calculus formulation, determine whether every such recursive type construction is definable in System $F$ when terms are identified up to $\beta\eta$-conversion.