Learn More
Parametric inductive types can be seen as functions taking type parameters as argument and returning the instantiated inductive types. Given functions between parameters one can construct function between the instantiated inductive types representing the change of parameters along these functions. It is well known that it is not a functor w.r.t intensional(More)
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. компьютерной(More)
  • 1