Checking Overlaps of Nominal Rewriting Rules
Electronic Notes in Theoretical Computer Science2016Vol. 323, pp. 39–56
Citations Over TimeTop 10% of 2016 papers
Abstract
Nominal rewriting generalises first-order rewriting by providing support for the specification of binding operators. In this paper, we give sufficient conditions for (local) confluence of closed nominal rewriting theories, based on the analysis of rule overlaps. More precisely, we show that closed nominal rewriting rules where all proper critical pairs are joinable are locally confluent. We also show how to refine the notion of rule overlap to derive confluence of the closed rewriting relation. The conditions that we define are easy to check using a nominal unification algorithm.