2000 character limit reached
Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies (0912.4947v3)
Published 30 Dec 2009 in cs.LO
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.