Dropping the restrictions on inductive types leads to a general
formulation of recursive types, which have quite different properties.
We show, for example, that with recursive types, a pure typed
lambda-calculus is not terminating, even without any explicit fixpoint
operator at the level of terms.