Capture-avoiding program transformations with name-fix

Abstract

We present an algorithm called name-fix that automatically eliminates variable capture from a generated program by systematically renaming variables. namefix is guided by a graph representation of the binding structure of a program, and requires name-resolution algorithms for the source language and the target language of a transformation. name-fix is generic and works for arbitrary transformations in any transformation system that supports origin tracking for names.