Uniform Traversal Combinators: Definition, Use and Properties

In this paper we explore ways of capturing well-formed patterns of recursion in the form of generic reductions. These reductions, called uniform traversal combinators, can substantially help the theorem proving process by eliminating the need for induction and can also be an aid in achieving effective program synthesis.