Hierarchical Nominal Terms and Their Theory of Rewriting
| Autor: | Murdoch J. Gabbay |
|---|---|
| Rok vydání: | 2007 |
| Předmět: |
Graph rewriting
Nominal terms General Computer Science Hierarchy (mathematics) Programming language Nominal rewriting nominal techniques Prefix grammar Term (logic) computer.software_genre Theoretical Computer Science TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Semi-Thue system Confluence ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION Rewriting computer meta-theory of logic and programming Mathematics Computer Science(all) |
| Zdroj: | Electronic Notes in Theoretical Computer Science. 174(5):37-52 |
| ISSN: | 1571-0661 |
| DOI: | 10.1016/j.entcs.2007.01.017 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect