This work presents the functional logic language Higher Order Babel which provides higher order unification for parameter passing and solving equations and ...

Together, rewriting and narrowing provide increased expressive power. We discuss some aspects of the theory of conditional rewriting, and the reasons underlying ...

Together, rewriting and narrowing provide increased expressive power. We discuss some aspects of the theory of conditional rewriting, and the reasons underlying ...

Feb 6, 2016 · Abstract. We propose a notion of complexity for oriented conditional rewrite systems satisfying certain restrictions.

The notion of conditional term rewriting systems that allows to simulate theories specified by conditional equations is presented.

In the field of conditional term rewriting systems, the reduction of a given term involves recursive reduction of the premises of the rule currently.

This paper investigates the semantics of con- ditional term rewriting systems with negation, which may not satisfy desirable properties like termination.

Abstract: This paper investigates the semantics of conditional term rewriting systems with negation which do not satisfy useful properties like termination.

Next we will consider the use of equational reasoning in general theorem proving programs. We also touch on the use of equations in logic and functional.

An architecture is presented for conditional term rewriting systems, which has been used to implement an interpreter for the Axis algebraic specification ...