J.-P. Jouannaud and A. Rubio. A recursive path ordering for higher-order terms in j-long fi-normal form. In H. Ganzinger, editor, Proc. 7th International Conference on Rewriting Techniques and Applications, volume 1103 of Lect. Not. in Comp. Sci. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Higher-Order Recursive Path Ordering - Jouannaud, Rubio (1999) (22 citations) Self-citation (Jouannaud Rubio) (Correct)
....we obtain as a biproduct a new proof of well foundedness of Dershowitz s recursive path ordering which does not use Kruskal s tree theorem anymore. Fourthly, our ordering can be adapted to operate on terms in j long fi normal form, yielding an ordering stronger than the already existing ones [12]. To hint at the strength of the ordering described in the present paper, let us mention that the polymorphic version of Godel s recursor for the natural numbers is easily oriented. And indeed, our ordering can prove at once the termination property of all monomorphic instances of a polymorphic ....
J.-P. Jouannaud and A. Rubio. A Recursive Path Ordering for Higher-Order Terms in j-Long fi-Normal Form, 1999.
The Higher-Order Recursive Path Ordering - Jouannaud, Rubio (1999) (22 citations) Self-citation (Jouannaud Rubio) (Correct)
....we obtain as a biproduct a new proof of well foundedness of Dershowitz s recursive path ordering which does not use Kruskal s tree theorem anymore. Fourthly, our ordering can be adapted to operate on terms in j long fi normal form, yielding an ordering stronger than the already existing ones [12]. To hint at the strength of the ordering described in the present paper, let us mention that the polymorphic version of Godel s recursor for the natural numbers is easily oriented. And indeed, our ordering can prove at once the termination property of all monomorphic instances of a polymorphic ....
J.-P. Jouannaud and A. Rubio. A Recursive Path Ordering for Higher-Order Terms in j-Long fi-Normal Form, 1999.
Higher-Order Proof by Consistency - Henrik Linnestad Olav (1996) (Correct)
No context found.
J.-P. Jouannaud and A. Rubio. A recursive path ordering for higher-order terms in j-long fi-normal form. In H. Ganzinger, editor, Proc. 7th International Conference on Rewriting Techniques and Applications, volume 1103 of Lect. Not. in Comp. Sci.
Higher-Order Equational Logic - Prehofer (1997) (Correct)
No context found.
J.-P. Jouannaud and A. Rubio. A recursive path ordering for higher-order terms in j-long fi-normal form. In H. Ganzinger, editor, Proc. Seventh International Conference on Rewriting Techniques and Applications (RTA'96). Springer LNCS 1103, 1996.
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