Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies

Abstract

We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are normalising for orthogonal, fully-extended iCRSs. These facts properly generalise a number of results on normalising strategies in first-order infinitary rewriting and provide the first examples of normalising strategies for infinitary lambda calculus.

Keywords

• computer science - logic in computer science
• d.3.1
• f.3.2
• f.4.1
• f.4.2