Applications of Higher-Order Narrowing
Christian Prehofer · Birkhäuser Boston eBooks · 1998
This section presents examples for higher-order rewriting and narrowing. Most of these applications fall into functional-logic programming, for which left-linear rewrite rules and thus Simple Systems suffice. Only the examples in Section 8.2 on program transformation and type inference go beyond programming with left-linear rules and more expressiveness is useful. For other examples on the utility of higher-order constructs, we refer to [Nip91a, MN97] for formalizing logics and λ-calculi, and for process algebras to [Po194]. Other application areas are program synthesis [Hag91b], machine learning [Har90, DW88], natural language processing [Nad87, PM90, GK96, GKL96], and theorem proving systems, for instance see [AINP90, Pau94, Gor88, CAB + 86, DFH + 93]. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.