Program transformations in terms of abstract syntax trees compromise referential integrity by introducing variable capture. Variable capture occurs when in the generated program a variable declaration accidentally shadows the intended target of a variable reference. Existing transformation systems either do not guarantee the avoidance of variable capture or impair the implementation of transformations. 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....
A wide range of computer programs, including compilers and the-orem provers, manipulate data structu...
Program transformations are an important area of metaprogramming. Compil-ers and preprocessors commo...
We have identified a class of whole-program transformations that are regular in structure and requir...
Abstract. Program transformations in terms of abstract syntax trees compromise referential integrity...
We present an algorithm called name-fix that automatically eliminates variable capture from a genera...
The application of program transformations and refactorings involves the risk of capturing variables...
syntax representation in which variables are not leaves and extraction of variable names from expres...
Naive program transformations can have surprising effects due to the interaction between introduced ...
A refactoring is a program transformation that improves the design of the source code, while preserv...
Static analyses and transformations are an important part of programming and domain specific languag...
We describe a language-independent theory for name binding and resolution, suitable for programming ...
Abstract. We describe a language-independent theory for name binding and resolution, suitable for pr...
The identifiers chosen by the programmers as entity names contain valuable information. They are oft...
Abstract: Teamwork is the typical characteristic of software development, because the tasks can be s...
Binding and substitution of bound... In this paper, we address the problem of names and name capture...
A wide range of computer programs, including compilers and the-orem provers, manipulate data structu...
Program transformations are an important area of metaprogramming. Compil-ers and preprocessors commo...
We have identified a class of whole-program transformations that are regular in structure and requir...
Abstract. Program transformations in terms of abstract syntax trees compromise referential integrity...
We present an algorithm called name-fix that automatically eliminates variable capture from a genera...
The application of program transformations and refactorings involves the risk of capturing variables...
syntax representation in which variables are not leaves and extraction of variable names from expres...
Naive program transformations can have surprising effects due to the interaction between introduced ...
A refactoring is a program transformation that improves the design of the source code, while preserv...
Static analyses and transformations are an important part of programming and domain specific languag...
We describe a language-independent theory for name binding and resolution, suitable for programming ...
Abstract. We describe a language-independent theory for name binding and resolution, suitable for pr...
The identifiers chosen by the programmers as entity names contain valuable information. They are oft...
Abstract: Teamwork is the typical characteristic of software development, because the tasks can be s...
Binding and substitution of bound... In this paper, we address the problem of names and name capture...
A wide range of computer programs, including compilers and the-orem provers, manipulate data structu...
Program transformations are an important area of metaprogramming. Compil-ers and preprocessors commo...
We have identified a class of whole-program transformations that are regular in structure and requir...