Towards Manipulation of Mutually Recursive Functions.
Hideya Iwasaki, Zhenjiang Hu, Masato Takeichi · 1998
In functional programming, Constructive Algorithmics is one of... In this paper, we shall formalize mutual recursive data types in terms of bifunctors and extend hylomorphisms to describe mutual recursive functions on this type. It is shown that theorems (transformation rules) for original hylomorphisms also hold while keeping the same form for extended (mutual) hylomorphisms. As a result, program transformation by calculation, which mechanically applies these theorems, is also possible without adding any special rules for mutual recursion.