Abstract

A rewrite system is called uniformly normalising if all its
steps are perpetual, i.e. are such that if s → t and s has an infinite reduction,
then t has one too. For such systems termination (SN) is equivalent
to normalisation (WN). A well-known fact is uniform normalisation of
orthogonal non-erasing term rewrite systems,
... read more