Efficient reductions with director strings

We present a name free lambda-calculus with explicit substitutions based on a generalized notion of director strings: we annotate a term with information about how each substitution should,be propagated through the term. We first present a calculus where we can simulate arbitrary beta-reduction steps, and then simplify the rules to model the evaluation of functional programs (reduction to weak head normal form). We also show that we can derive the closed reduction strategy (a weak strategy which, in contrast with standard weak strategies allows certain reductions to take place inside lambda-abstractions thus offering-more sharing). Our experimental results confirm that, for large combinator based terms, our weak evaluation strategies out-perform standard evaluators. Moreover, we derive two abstract machines for strong reduction which inherit the efficiency of the weak evaluators.