Publisher Summary This chapter focuses on rewrite systems, which are directed equations
used to compute by repeatedly replacing sub-terms of a given formula with equal terms until …

Functional and logic programming are the most important declarative programming
paradigms, and interest in combining them has grown over the last decade. Early research …

In this paper we analyze completeness results for basic narrowing. We show that basic
narrowing is not complete with respect to normalizable solutions for equational theories …

We investigate the experimental programming language BABEL, designed to achieve
integration of functional programming (as embodied in HOPE, Standard ML, or MIRANDA) …

We already presented two ways of handling equality within first order theories: First, by
giving an explicit set of first-order axioms and, second, by replacing the unification algorithm …

Kernel-LEAF is a logic plus functional language based on the flattening technique. It differs
from other similar languages because it is able to cope with partial (undefined or non …

Term-rewriting systems, that is, sets of directed equations, provide a paradigm of
computation with particularly simple syntax and semantics. Rewrite systems may be used for …

We present a method and a tool for generating test sets from algebraic data type
specifications. We give formal definitions of the basic concepts required in our approach of …

Conditional equations provide a paradigm of computation that combines the clean syntax
and semantics of LISP-like functional programming with Prolog-like logic programming in a …

The paper considers different methods of integrating the functional and logic programming
paradigms, starting with the identification of their semantic differences. The main methods to …