Details

Autor(en) / Beteiligte

• TIP, Frank
• FUHRER, Robert M
• KIEZUN, Adam
• ERNST, Michael D
• BALABAN, Ittai
• DE SUTTER, Bjorn

Titel

Refactoring Using Type Constraints

Ist Teil von

• ACM transactions on programming languages and systems, 2011-04, Vol.33 (3), p.1-47

Ort / Verlag

New York, NY: Association for Computing Machinery

Erscheinungsjahr

2011

Quelle

EBSCOhost Business Source Ultimate

Beschreibungen/Notizen

• Type constraints express subtype relationships between the types of program expressions, for example, those relationships that are required for type correctness. Type constraints were originally proposed as a convenient framework for solving type checking and type inference problems. This paper shows how type constraints can be used as the basis for practical refactoring tools. In our approach, a set of type constraints is derived from a type-correct program P . The main insight behind our work is the fact that P constitutes just one solution to this constraint system, and that alternative solutions may exist that correspond to refactored versions of P . We show how a number of refactorings for manipulating types and class hierarchies can be expressed naturally using type constraints. Several refactorings in the standard distribution of Eclipse are based on our work.