Nominal rewriting introduced a novel method of specifying rewriting on syntax-with-binding. We extend this treatment of rewriting with hierarchy of variables representing increasingly 'meta-level' variables, e.g. in hierarchical nominal term rewriting the meta-level unknowns (representing unknown terms) in a rewrite rule can be 'folded into' the syntax itself (and rewritten). To the extent that rewriting is a mathematical meta-framework for logic and computation, and nominal rewriting is a framework with native support for binders, hierarchical nominal term rewriting is a meta-to-the-omega level framework for logic and computation with binders. © 2007 Elsevier B.V. All rights reserved.
|Number of pages||16|
|Journal||Electronic Notes in Theoretical Computer Science|
|Publication status||Published - 2 Jun 2007|
- meta-theory of logic and programming
- Nominal rewriting
- nominal techniques