@inproceedings{10.1007/978-3-662-44522-8_21,
Abstract = {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 while preserving the rewriting relation. This result, together with previous translations from CRSs to NRSs and between CRSs and other higher-order rewriting formalisms, opens 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.},
Address = {Berlin, Heidelberg},
Author = {Dom{\'\i}nguez, Jes{\'u}s and Fern{\'a}ndez, Maribel},
BookTitle = {Mathematical Foundations of Computer Science 2014},
Editor = {Csuhaj-Varj{\'u}, Erzs{\'e}bet and Dietzfelbinger, Martin and {\'E}sik, Zolt{\'a}n},
ISBN = {978-3-662-44522-8},
Pages = {244--255},
Publisher = {Springer Berlin Heidelberg},
Title = {Relating Nominal and Higher-Order Rewriting},
Year = {2014},
date-added = {2019-09-12 18:34:39 +0200},
date-modified = {2019-09-12 18:34:39 +0200},
doi = {10.1007/978-3-662-44522-8_21}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A