The classification of polynomial orderings on monadic terms

Applicable Algebra in Engineering, Communications and Computing

Volumn 12, Issue 3, 2001, Pages 197-226

  Cropper, Nick ^a   Martin, Ursula ^b  

^a UNIVERSITY OF YORK   (United Kingdom)

^b UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

Ordinals; Term rewriting systems; Termination

Indexed keywords

COMPUTATIONAL METHODS; FUNCTION EVALUATION; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA;

UNARY FUNCTIONS;

POLYNOMIALS;

EID: 0034915015     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002000000044     Document Type: Article

References (23)

1. Termination of rewriting systems by polynomial interpretations and its implementation
2. Polynomial interpretations and the complexity of algorithms
3. Term rewriting theory for the primitive recursive functions
4. Well-partial orderings and hierarchies
5. Proving termination with multiset orderings
6. A note on simplification orderings
7. An overview of LP, the Larch proyer
8. On total simplification orderings on strings
9. Termination proofs by multiset path ordering imply primitive recursive derivation lengths
10. On multiset orderings
11. RRL: Rewrite rule laboratory
12. On the termination of Markov algorithms
13. On the diversity of orderings on strings
14. The order types of termination orderings on monadic terms, strings and multisets
15. Simple termination revisited
16. Weights for total division orderings on strings
17. Generating polynomial orderings
18. Simplification orderings: History of results
19. The proof-theoretic complexity of recursive programs