Linear Higher-Order Matching Is NP-Complete

Philippe de Groote. Linear Higher-Order Matching Is NP-Complete. In Leo Bachmair, editor, Rewriting Techniques and Applications, 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000, Proceedings. Volume 1833 of Lecture Notes in Computer Science, pages 127-140, Springer, 2000.

Abstract

Abstract is missing.