Add to ORKGWe show that, contrary to the situation in first-order term rewriting, almost none of the usual properties of rewriting are modular for higher-order rewriting, irrespective of the higher-order rewriting format. For the particular format of simply typed applicative term rewriting systems we prove that modularity of confluence, normalization, and termination can be recovered by imposing suitable linearity constraints
AbstractIt is known that termination and completeness are not modular properties of term rewriting s...
We provide a global technique, called neatening, for the study of modularity of left-linear term rew...
. Term rewriting systems play an important role in various areas, e.g. in abstract data type specifi...
We show that, contrary to the situation in first-order term rewriting, almost none of the usual prop...
We show that, contrary to the situation in first-order term rewriting, almost none of the usual prop...
AbstractA property of term rewriting systems is called modular if it is preserved under disjoint uni...
Colloque avec actes et comité de lecture.We investigate modular properties of term rewriting systems...
Modular properties of term rewriting systems, i.e. properties which are preserved under disjoint uni...
Abstract. A modular property of term rewriting systems is one that holds for the direct sum of two d...
Modular properties of term rewriting systems, i.e. properties which are preserved under disjoint uni...
AbstractA modular property of term rewriting systems is one that holds for the direct sum of two dis...
Abstract. A modular property of term rewriting systems is one that holds for the direct sum of two d...
AbstractWe study modular properties in strongly convergent infinitary term rewriting. In particular,...
We investigate restricted termination and confluence properties of term rewriting systems, in partic...
. Monads can be used to model term rewriting systems by generalising the well-known equivalence betw...
AbstractIt is known that termination and completeness are not modular properties of term rewriting s...
We provide a global technique, called neatening, for the study of modularity of left-linear term rew...
. Term rewriting systems play an important role in various areas, e.g. in abstract data type specifi...
We show that, contrary to the situation in first-order term rewriting, almost none of the usual prop...
We show that, contrary to the situation in first-order term rewriting, almost none of the usual prop...
AbstractA property of term rewriting systems is called modular if it is preserved under disjoint uni...
Colloque avec actes et comité de lecture.We investigate modular properties of term rewriting systems...
Modular properties of term rewriting systems, i.e. properties which are preserved under disjoint uni...
Abstract. A modular property of term rewriting systems is one that holds for the direct sum of two d...
Modular properties of term rewriting systems, i.e. properties which are preserved under disjoint uni...
AbstractA modular property of term rewriting systems is one that holds for the direct sum of two dis...
Abstract. A modular property of term rewriting systems is one that holds for the direct sum of two d...
AbstractWe study modular properties in strongly convergent infinitary term rewriting. In particular,...
We investigate restricted termination and confluence properties of term rewriting systems, in partic...
. Monads can be used to model term rewriting systems by generalising the well-known equivalence betw...
AbstractIt is known that termination and completeness are not modular properties of term rewriting s...
We provide a global technique, called neatening, for the study of modularity of left-linear term rew...
. Term rewriting systems play an important role in various areas, e.g. in abstract data type specifi...