Abstract for "Higher-Order Conditional Rewriting in the L-lambda Logic Programming Language"
Higher-Order Conditional Rewriting in the L-lambda Logic Programming Language
Amy Felty. In Third International Workshop on Extensions to Logic Programming: Preprints of the Proceedings, Evelina Lamma and Paola Mello, eds., February 1992.

Abstract: In this paper, we extend the notions of first-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 theorem proving and functional programming. We then illustrate that these rewrite systems can be naturally specified and implemented in a higher-order logic programming language.