Capture-avoiding program transformations with name-fix
We present an algorithm called name-fix that automatically eliminates variable capture from a generated program by systematically renaming variables. name-fix 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.
|Software Engineering and Management 2015|
|Organisation||Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands|
Erdweg, S, van der Storm, T, & Dai, Y. (2015). Capture-avoiding program transformations with name-fix. In Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI) (pp. 93–94).