An effective proof of the well-foundedness of the multiset path ordering

The Coq proof assistant : reference manual, version 6.1

Bruno Barras, Samuel Boutin, Cristina Cornes et al. · OpenGrey (Institut de l'Information Scientifique et Technique) · 1997 · 989 citations · Full text

Computing, Computer Science, Mathematics +15

Orderings for term-rewriting systems

Nachum Dershowitz · Theoretical Computer Science · 1982 · 607 citations

Computing, Computer Science, Algorithms +6

Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture

Joseph B. Kruskal · Transactions of the American Mathematical Society · 1960 · 455 citations · Full text

Natural Sciences, Mathematics, Discrete Mathematics +5

On well-quasi-ordering finite trees

C. St. J. A. Nash‐Williams · Mathematical Proceedings of the Cambridge Philosophical Society · 1963 · 313 citations

Natural Sciences, Mathematics, Combinatorics +2

On the Uniform Halting Problem for Term Rewriting Systems

G. Huet · Medical Entomology and Zoology · 1978 · 178 citations

Computing, Computer Science, Algorithms +6