无穷组合归约系统：规范化归约策略
Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
摘要：
我们研究无穷组合归约系统（iCRS）的规范化归约策略。我们证明了所有的公平，outermost公平，和所需的公平的策略是规范化的正交，完全扩展的iCRS。这些事实适当地概括了一些结果规范化战略在一阶无穷重写，并提供了第一个例子规范化战略的无穷λ演算。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
