A Constructive Axiomatization of the Recursive Path Ordering

A Constructive Axiomatization of the Recursive Path Ordering (2006)

Cached

Download Links

[color.loria.fr]

by Solange Coupet-Grimal , William Delobel

Citations:

2 - 0 self

BibTeX

@MISC{Coupet-Grimal06aconstructive,
    author = {Solange Coupet-Grimal and William Delobel},
    title = {A Constructive Axiomatization of the Recursive Path Ordering },
    year = {2006}
}

Bookmark

OpenURL

Abstract

Citations

253	Orderings for term-rewriting systems - Dershowitz - 1982
101	the tree theorem, and Vazsonyi’s conjecture - Well-quasi-ordering - 1960
47	Two generalizations of the recursive path ordering - Kamin, Levy - 2005
40	The higher-order recursive path ordering - Jouannaud, Rubio - 1999
22	Computer experiments with the REVE term rewriting system generator - Lescanne - 1983
18	Well-foundedness of Term Orderings - Ferreira, Zantema - 1995
18	Higher-order rewriting - Raamsdonk - 2003
9	HigherOrder Recursive Path Orderings a la carte - Jouannaud, Rubio - 2003
9	Termination Proof of Term Rewriting System with the Multiset Path Ordering. A Complete Development - Leclerc - 1995
7	An effective proof of the well-foundedness of the multiset path ordering. Rapport de recherche - Coupet-Grimal, Delobel - 2005
5	Well-founded recursive relations - Goubault-Larrecq - 2001
5	Well-foundedness of the Higher-Order Recursive Path Ordering in Coq - Koprowski - 2004
4	Some properties of decomposition ordering, A simplification ordering to prove termination of rewriting systems - Lescanne
4	An Inductive Proof of the Well-foundedness of the Multiset Order. Due to Wilfried Buchholz - Nipkow - 1998
2	A general theorem on termination of rewriting - Dawson, Goré - 2004