Meta-computation in conditional term rewriting systems

We propose a framework of conditional term rewriting systems equipped with meta-computation supported by basic mechanisms called meta-transformation and base-transformation. The arguments of a redex, the context around the redex and the current set of meta-conditional rewrite rules are considered as meta-level objects in our system, and by the meta-transformation they are transformed into base-level objects. The base-transformation transforms base-level objects called meta-representation into meta-level objects.