## Efficient Call-by-value Evaluation Strategy of Primitive Recursive Program Schemes (1995)

Venue: | FUJI INTERNATIONAL WORKSHOP ON FUNCTIONAL AND LOGIC PROGRAMMING, SUSONO JAPAN, PROCEEDINGS |

### BibTeX

@TECHREPORT{Mößle95efficientcall-by-value,

author = {Andrea Mößle and Heiko Vogler},

title = {Efficient Call-by-value Evaluation Strategy of Primitive Recursive Program Schemes},

institution = {FUJI INTERNATIONAL WORKSHOP ON FUNCTIONAL AND LOGIC PROGRAMMING, SUSONO JAPAN, PROCEEDINGS},

year = {1995}

}

### OpenURL

### Abstract

We consider primitive recursive program schemes with parameters together with the callby -value computation rule. The schemes are finite systems of functions which are defined by primitive (or: structural) recursion; simultaneous recursion and nesting of function calls is allowed. We present a transformation strategy which replaces primitive recursion by iteration. The transformation strategy which is fully automatic, takes as input a primitive recursive program scheme M with parameters and it computes a program scheme M 0 as output. We prove that, for every argument tuple, M 0 is at least as (time) efficient as M . We also prove that there are infinitely many nontrivial primitive recursive program schemes M with parameters for which the transformation yields a program scheme M 0 such that there are infinitely many argument tuples for which M 0 is more efficient than M . Moreover, we provide an algorithm which decides for an arbitrary given primitive recursive program scheme M...