geometric memory growth

[Pascal Brisset]

 > > Given a function f and a bound variable B (constant!) . Under what
 > > circumstances may f(B) be evaluated while defining the
 > > function bound to F.
 > >
 > > F = fun() ->  f(B) end,
 > 
 > Isn't this basically an example of constant propagation?

Constant propagation should be safe, but it is only a subset.
It may still interfere with benchmarks where people expect
computations to take place in a specific context.
Lambda-calculists would see the general case as "reducing
under the lambda".

Side effects are obviously a concern (including exceptions).

Consider also the case where f(B) loops infinitely.

-- Pascal