A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
In this paper, we generalise the notion of explicit substitution from the -calculus to higher order rewriting, realised by combinatory reduction systems (CRSs). For every con uent CRS, R, we construct an explicit substitution variant, Rx, which we prove con uent. We identify a large subset of the CRSs, the structure-preserving CRSs, and show for any structure-preserving CRS R that Rx preserves strong normalisation of R. We believe that this is a signi cant rst step towards providing adoi:10.1007/3-540-61464-8_51 fatcat:qgdfp3leazhdbcy26wknxeyceu