These variations were later generalized into three categories: single, double, and triple shag.

It was later generalized to algebraic curves, to higher-dimensional varieties and beyond.

Conklin later generalized the concept of problem wickedness to areas other than planning and policy.

The shunting-yard algorithm has been later generalized into operator-precedence parsing.

Later generalized to covers over stop/reset switches on disk drives and networking equipment.

Emil Artin later generalized it to the case of Artinian rings.

This was later generalized to a city regarded as a center of a specified activity, or any large, important city in a nation.

Tychonoff later generalized this to the product of collections of arbitrary compact spaces.

This concept first arose in calculus, and was later generalized to the more abstract setting of order theory.

The method was later generalized, allowing the computation of non-square roots.