Tobias Nipkow. Nigher-Order Critical Pairs. In Proc. 6th IEEE Symposium on Logic in Computer Science, pages 342--349, 1991.  Home/Search   Document Not in Database   Summary   Related Articles

....readable once one understands the principles involved, the translation still requires some effort. While there has been considerable work on rewriting systems and unifications for higher order terms, most of it has considered unification or pattern up to fi convertibility rather than ff congruence [12, 13] Most of this work is also restricted to typed terms, a restriction that is unnecessary for us. The work closest to ours that we are aware of is the v unification of Talcott [17] Talcott gives an algorithm for deciding ff unification for a class of binding structures that generalize conventional ....

Tobias Nipkow. Nigher-Order Critical Pairs. In Proc. 6th IEEE Symposium on Logic in Computer Science, pages 342--349, 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC