Abstract | ||
---|---|---|
The paper presents: (1) a graph-based theoretical background to refactoring a correct heterogeneous meta-program into its k-stage representation; (2) the refactoring method; (3) refactoring experiments with tasks taken from different domains, including real world tasks, such as meta-programs to teach Computer Science (CS) topics using educational robots. Refactoring meta-programs by staging enables to flexibly adapt them to the different context of use. To do that (semi-) automatically, we use the contextual information as a priority relation (e. g. highest, lowest, etc.) introduced within the meta-program specification. We implement the refactoring method using the so-called activating/de-activating label (index) to change the role of meta-language constructs at different stages. The contribution of the paper is: (1) applying the known (in programming) staging concept to heterogeneous meta-programming; (2) a theoretical background, properties and the method to solve tasks of this kind of refactoring. |
Year | DOI | Venue |
---|---|---|
2014 | 10.5755/j01.itc.43.1.3715 | INFORMATION TECHNOLOGY AND CONTROL |
Keywords | Field | DocType |
refactoring, meta-program, meta-parameter, meta-programming, multi-stage heterogeneous meta-program | Metaprogramming,Graph,Contextual information,Programming language,Computer science,Real-time computing,Educational robotics,Code refactoring | Journal |
Volume | Issue | ISSN |
43 | 1 | 1392-124X |
Citations | PageRank | References |
1 | 0.36 | 18 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Vytautas Stuikys | 1 | 102 | 17.07 |
Kristina Bespalova | 2 | 4 | 2.43 |
Renata Burbaite | 3 | 12 | 3.98 |