Add to ORKGWe 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
This paper is concerned with a programming language construct for typed name binding that enforces α...
The identifiers chosen by the programmers as entity names contain valuable information. They are oft...
Name obfuscation is a software protection technique, which renames identifiers in a given program, t...
Abstract. Program transformations in terms of abstract syntax trees compromise referential integrity...
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...
We describe a language-independent theory for name binding and resolution, suitable for programming ...
We describe a language-independent theory for name binding and resolution, suitable for programming ...
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...
Naive program transformations can have surprising effects due to the interaction between introduced ...
We propose an extension with name variables of a calculus for incremental rebinding of code introduc...
AbstractWe propose an extension with name variables of a calculus for incremental rebinding of code ...
Binding and substitution of bound... In this paper, we address the problem of names and name capture...
In this paper a new kind of anti-unification problems is introduced, where the substitutions anti-un...
This paper is concerned with a programming language construct for typed name binding that enforces α...
The identifiers chosen by the programmers as entity names contain valuable information. They are oft...
Name obfuscation is a software protection technique, which renames identifiers in a given program, t...
Abstract. Program transformations in terms of abstract syntax trees compromise referential integrity...
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...
We describe a language-independent theory for name binding and resolution, suitable for programming ...
We describe a language-independent theory for name binding and resolution, suitable for programming ...
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...
Naive program transformations can have surprising effects due to the interaction between introduced ...
We propose an extension with name variables of a calculus for incremental rebinding of code introduc...
AbstractWe propose an extension with name variables of a calculus for incremental rebinding of code ...
Binding and substitution of bound... In this paper, we address the problem of names and name capture...
In this paper a new kind of anti-unification problems is introduced, where the substitutions anti-un...
This paper is concerned with a programming language construct for typed name binding that enforces α...
The identifiers chosen by the programmers as entity names contain valuable information. They are oft...
Name obfuscation is a software protection technique, which renames identifiers in a given program, t...