Higher-Order Conditional Term Rewriting in the L Logic Programming Language Preliminary Results

In this paper, we extend the notions of rst-order conditional rewrite systems and higher-order rewrite systems to obtain higher-order conditional rewriting. Such rewrite systems can be used to directly express many operations in theo-rem proving and functional programming. We then illustrate that these rewrite systems can be naturally specied and implemented in a higher-order logic pro-gramming language. This paper was presented at the Third International Work-shop on Extensions of Logic Programming, February 1992.