Abstract | ||
---|---|---|
We consider a generalization of heterogeneous meta-programs by (1) introducing an extra level of abstraction within the meta-program structure, and (2) meta-program transformations. We define basic terms, formalize transformation tasks, consider properties of meta-program transformations and rules to manage complexity through the following transformation processes: (1) reverse transformation, when a correct one-stage meta-program M1 is transformed into the equivalent two-stage meta-meta-program M2; (2) two-stage forward transformations, when M2 is transformed into a set of meta-programs, and each meta-program is transformed into a set of target programs. The results are as follows: (a) formalization of the transformation processes within the heterogeneous meta-programming paradigm; (b) introduction and approval of equivalent transformations of meta-programs into meta-meta-programs and vice versa; (c) introduction of metrics to evaluate complexity of meta-specifications. The results are approved by examples, theoretical reasoning and experiments. |
Year | Venue | Keywords |
---|---|---|
2013 | Informatica, Lith. Acad. Sci. | meta-programming, generalization, transformation, meta-program complexity |
Field | DocType | Volume |
Metaprogramming,Mathematical optimization,Abstraction,Computer science,Algorithm,Theoretical computer science,Versa | Journal | 24 |
Issue | ISSN | Citations |
2 | 0868-4952 | 0 |
PageRank | References | Authors |
0.34 | 22 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Vytautas Stuikys | 1 | 102 | 17.07 |
Robertas Damasevicius | 2 | 281 | 62.75 |
DamaševičiusRobertas | 3 | 0 | 0.34 |