Orthogonal Higher-Order Rewrite Systems are Confluent

Tobias Nipkow. Orthogonal Higher-Order Rewrite Systems are Confluent. In Marc Bezem, Jan Friso Groote, editors, Typed Lambda Calculi and Applications, International Conference on Typed Lambda Calculi and Applications, TLCA 93, Utrecht, The Netherlands, March 16-18, 1993, Proceedings. Volume 664 of Lecture Notes in Computer Science, pages 306-317, Springer, 1993.

Abstract

Abstract is missing.