AbstractNominal 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
We study Higher-Order Rewrite Systems (HRSs) which extend term rewriting to -terms. HRSs can descri...
We present a new criterion for confluence of (possibly) non-terminating left-linear term rewriting s...
We study the combination of the following already known ideas for showing confluence ofunconditional...
We consider matching, rewriting, critical pairs and the Knuth-Bendix confluence test on rewrite rule...
Nominal rewriting systems (Fernandez, Gabbay, Mackie, 2004; Fernandez, Gabbay, 2007) have been intro...
We design a completion procedure for nominal rewriting systems, based on a generalisation of the rec...
AbstractNominal rewriting is based on the observation that if we add support for α-equivalence to fi...
As it is well-known, the critical pair lemma enables a finite test for confluence of (finite) termin...
AbstractRecursion can be conveniently modeled with left-linear positive/negative-conditional term re...
We present a generalisation of rst-order rewriting which al-lows us to deal with terms involving bin...
We present a generalisation of �rst-order rewriting which al- lows us to deal with terms involving ...
Nominal rewriting extends first-order rewriting with Gabbay-Pitts abstractors: bound entities are ex...
Abstract. We present a translation function from nominal rewriting systems (NRSs) to combinatory red...
AbstractFor graph rewriting systems a notion of critical pair based only on the rewriting rules is d...
We investigate restricted termination and confluence properties of term rewriting systems, in partic...
We study Higher-Order Rewrite Systems (HRSs) which extend term rewriting to -terms. HRSs can descri...
We present a new criterion for confluence of (possibly) non-terminating left-linear term rewriting s...
We study the combination of the following already known ideas for showing confluence ofunconditional...
We consider matching, rewriting, critical pairs and the Knuth-Bendix confluence test on rewrite rule...
Nominal rewriting systems (Fernandez, Gabbay, Mackie, 2004; Fernandez, Gabbay, 2007) have been intro...
We design a completion procedure for nominal rewriting systems, based on a generalisation of the rec...
AbstractNominal rewriting is based on the observation that if we add support for α-equivalence to fi...
As it is well-known, the critical pair lemma enables a finite test for confluence of (finite) termin...
AbstractRecursion can be conveniently modeled with left-linear positive/negative-conditional term re...
We present a generalisation of rst-order rewriting which al-lows us to deal with terms involving bin...
We present a generalisation of �rst-order rewriting which al- lows us to deal with terms involving ...
Nominal rewriting extends first-order rewriting with Gabbay-Pitts abstractors: bound entities are ex...
Abstract. We present a translation function from nominal rewriting systems (NRSs) to combinatory red...
AbstractFor graph rewriting systems a notion of critical pair based only on the rewriting rules is d...
We investigate restricted termination and confluence properties of term rewriting systems, in partic...
We study Higher-Order Rewrite Systems (HRSs) which extend term rewriting to -terms. HRSs can descri...
We present a new criterion for confluence of (possibly) non-terminating left-linear term rewriting s...
We study the combination of the following already known ideas for showing confluence ofunconditional...