Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
classification
💻 cs.LO
keywords
normalisingstrategiesinfinitaryreductioncombinatoryicrsssystemscalculus
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.