Generalization, also called anti-unification, is the dual of unification. A generalizer two terms t and $t^{\prime }$ a term \prime which are substitution instances. The most general equational unifiers that least generalizers, i.e., specific anti-instances modulo equations. In previous work, we extended classical untyped generalization algorithm to: (1) an order-sorted typed setting with sorts...