Download PDFOpen PDF in browserCritical Pair Analysis in Nominal Rewriting13 pages•Published: March 27, 2016AbstractNominal rewriting (Fernández, Gabbay & Mackie, 2004;Fernández & Gabbay, 2007) is a framework that extends first-order term rewriting by a binding mechanism based on the nominal approach (Gabbay & Pitts, 2002; Pitts, 2003). In this paper, we investigate confluence properties of nominal rewriting, following the study of orthogonal systems in (Suzuki et al., 2015), but here we treat systems in which overlaps of the rewrite rules exist. First we present an example where choice of bound variables (atoms) of rules affects joinability of the induced critical pairs. Then we give a detailed proof of the critical pair lemma, and illustrate some of its applications including confluence results for non-terminating systems. Keyphrases: alpha equivalence, confluence, critical pairs, nominal rewriting In: James H. Davenport and Fadoua Ghourabi (editors). SCSS 2016. 7th International Symposium on Symbolic Computation in Software Science, vol 39, pages 156-168.
|