Combinatory reduction systems with explicit substitution that preserve strong normalisation

Abstract

We generalise the notion of explicit substitution from the λ-calculus to higher order rewriting, realised by combinatory reduction systems (CRSs). For every confluent CRS, R, we construct an explicit substitution variant, Rx, which we prove confluent.