We prove that fully-extended, orthogonal infinitary combinatory reduction systems with finite right-hand sides are confluent modulo identification of hypercollapsing subterms. This provides the first general confluence result for infinitary higher-order rewriting. © Springer-Verlag Berlin Heidelberg 2005.
Proceedings title: Logic for Programming, Artificial Intelligence, and Reasoning, 12th International Conference, LPAR 2005, Montego Bay, Jamaica, December 2-6, 2005, Proceedings
Editors: G. Sutcliffe, A. Voronkov