Efficient Call-by-value Evaluation of Primitive Recursive Program Schemes

We provide a transformation strategy for primitive recursive program schemes which is based on the three transformation relations splitting, sharing, and tupling, and which is provably semantic preserving. The transformation strategy works "without eureka". We can prove that there are infinitely many nontrivial primitive recursive program schemes for which the resulting recursive program scheme is strictly more efficient than the original one