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 -calculus. Contents

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Jeroen Ketema, Jakob Grue Simonsen
• Keywords: CORR 2010, Education, Infinitary Combinatory Reduction, Strategies, Study Normalising