King's College London

Research portal

From nominal to higher-order and back again

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review

Original languageEnglish
Title of host publicationLogical methods in computer science
PublisherarXhiv.org
Pages1-41
Number of pages41
Volume11
Published11 Dec 2015

Links

King's Authors

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, 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.

View graph of relations

© 2020 King's College London | Strand | London WC2R 2LS | England | United Kingdom | Tel +44 (0)20 7836 5454