Publication details

Saarland University Computer Science

Ordering Constraints on Trees

Hubert Comon, Ralf Treinen

Colloquium on Trees in Algebra and Programming, pp. 1--14, Springer-Verlag, April 1994

We survey recent results about ordering constraints on trees and discuss their applications. Our main interest lies in the family of recursive path orderings which enjoy the properties of being total, well-founded and compatible with the tree constructors. The paper includes some new results, in particular the undecidability of the theory of lexicographic path orderings in case of a non-unary signature.

Download PDF        Show BibTeX               

Login to edit

Legal notice, Privacy policy