{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T15:40:47Z","timestamp":1757778047329,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2015,12,14]],"date-time":"2015-12-14T00:00:00Z","timestamp":1450051200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We present a translation function from nominal rewriting systems (NRSs) to\ncombinatory reduction systems (CRSs), transforming closed nominal rules and\nground nominal terms to CRSs rules and terms, respectively, while preserving\nthe rewriting relation. We also provide a reduction-preserving translation in\nthe other direction, from CRSs to NRSs, improving over a previously defined\ntranslation. These tools, together with existing translations between CRSs and\nother higher-order rewriting formalisms, open up the path for a transfer of\nresults between higher-order and nominal rewriting. In particular, techniques\nand properties of the rewriting relation, such as termination, can be exported\nfrom one formalism to the other.<\/jats:p>","DOI":"10.2168\/lmcs-11(4:9)2015","type":"journal-article","created":{"date-parts":[[2016,11,21]],"date-time":"2016-11-21T13:46:40Z","timestamp":1479736000000},"source":"Crossref","is-referenced-by-count":1,"title":["From nominal to higher-order rewriting and back again"],"prefix":"10.46298","volume":"Volume 11, Issue 4","author":[{"given":"Jes\u00fas","family":"Dom\u00ednguez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maribel","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2015,12,14]]},"reference":[{"key":"1088:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1610\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1610\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:07:46Z","timestamp":1681243666000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1610"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,14]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-11(4:9)2015","relation":{"is-same-as":[{"id-type":"arxiv","id":"1509.05318","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1509.05318","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2015,12,14]]},"article-number":"1610"}}