full evaluation should exclude single-step unfolding

v-nys / cclp

A rewrite of my implementation of the Compiling Control technique, in Racket.

MIT License

1 stars 0 forks source link

full evaluation should exclude single-step unfolding #19

Closed v-nys closed 7 years ago

v-nys commented 7 years ago

The simplest way to analyse the primes example would be to perform full evaluation of integers(g,g) and length(g,g). It also makes sense not to apply single-step unfolding when full evaluation is possible. This is kind of halfway between bug and enhancement.