We consider the problem of incorporation of new computational rules in lambda calculus with inductive types and recursion.
We consider the extensions of standard reduction systems by certain new reductions preserving strong normalization and Church-Rosser property with possible applications to proof assistants and computer algebra systems.