F. van Raamsdonk. Higher-order rewriting. In Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA '99), pages 220--239. Springer LNCS 1631, 99. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Evaluation Strategies for Functional Logic Programming - Antoy (2001) (2 citations) (Correct)
....rewrite strategies for higherorder TRSs. However, the well known outermost fair rewrite strategy, which is normalizing for almost orthogonal TRSs [20] is normalizing also for weaklyorthogonal higher order TRSs if an additional condition, full extension, is imposed on higher order rewrite rules [23]. The theory of higher order narrowing is even less developed. Similar to the first order case, several classes of higherorder TRSs have been proposed for higher order functional logic computations, e.g. SFL programs [12] applicative TRSs [19] and higher order inductively sequential TRSs [15] ....
F. van Raamsdonk. Higher-order rewriting. In Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA '99), pages 220--239. Springer LNCS 1631, 99.
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