ded abstract of this paper is published in the proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems, Pont- -Mousson, 1992 1
We consider function fields of functions of one variable augmented by the binary operation of composition of functions. It is shown that the straightforward axiom
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...