Higher-order (non-)modularity

Abstract

We 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.