## Weak orthogonality implies confluence: The higher-order case.(English)Zbl 0964.68523

Nerode, A. (ed.) et al., LFCS ’94, Logical foundations of computer science. 3rd International Symposium, St. Petersburg, Russia, July 11-14, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 813, 379-392 (1994).
Summary: In this paper we prove confluence for weakly orthogonal higher-order rewriting systems. This generalises all the known ‘confluence by orthogonality’ results.
For the entire collection see [Zbl 0865.00034].

### MSC:

 68Q42 Grammars and rewriting systems 03B40 Combinatory logic and lambda calculus