| Original language | English |
|---|
| Title of host publication | Logical methods in computer science |
|---|
| Publisher | arXhiv.org |
|---|
| Pages | 1-41 |
|---|
| Number of pages | 41 |
|---|
| Volume | 11 |
|---|
| Published | 11 Dec 2015 |
|---|
- Population Health Sciences
We present a translation function from nominal rewriting systems (NRSs) to
combinatory reduction systems (CRSs), transforming closed nominal rules and ground
nominal terms to CRSs rules and terms, respectively, while preserving the rewriting relation.
We also provide a reduction-preserving translation in the other direction, from CRSs
to NRSs, improving over a previously defined translation. These tools, together with existing
translations between CRSs and other higher-order rewriting formalisms, open up the
path for a transfer of results between higher-order and nominal rewriting. In particular,
techniques and properties of the rewriting relation, such as termination, can be exported
from one formalism to the other.