[Submit a comment] [RTALooP home] [Index] [Previous] [Next]

[Postscript] [PDF] [BibTeX Source] [LaTeX Source]

Problem #27

Originator: Pierre Lescanne
Date: April 1991

Summary: How can the notion of well-rewrite-ordering be used to as the basis for some new kind of “recursive path ordering”?

In [Les90] an extension of term embedding, called “well-rewrite orderings”, was introduced, leading to an extension of the concept of simplification ordering. How can those ideas best be extended to form the basis for some new kind of “recursive path ordering”?

Remark

Progress in this direction has been reported in [Wei92].

References

[Les90]

Pierre Lescanne. Well rewrite orderings. In John C. Mitchell, editor, Fifth Symposium on Logic in Computer Science, pages 239–256, Philadelphia, PA, June 1990. IEEE.

[Wei92]

Andreas Weiermann. Well-rewrite orderings and the induced recursive path orderings. Unpublished note, Institut für Mathematische Logik und Grundlagenforschung, 1992.

[Submit a comment] [RTALooP home] [Index] [Previous] [Next]

[Postscript] [PDF] [BibTeX Source] [LaTeX Source]