Higher-Order Functional-Logic Programming: A Systematic Development

Wedevelop an effective model for higher-order functional-logic programming by refining higher-order narrowing calculi. The refinements reduce the high degree of non-determinism in narrowing calculi, utilizing properties of functional(-logic) programs. These include convergent and left-linear rewrite rules. All refinements can be combined to a narrowing strategy which generalizes call-by-need as in functional programming. Furthermore, we consider conditional rewrite rules which are often convenient for programming applications