Strictly orthogonal left linear rewrite systems and primitive recursion
From MaRDI portal
Recommendations
- Bounding derivation lengths with functions from the slow growing hierarchy
- Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
- Term rewriting theory for the primitive recursive functions
- scientific article; zbMATH DE number 2043536
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
Cites work
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- scientific article; zbMATH DE number 3857078 (Why is no real title available?)
- scientific article; zbMATH DE number 599028 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 3247155 (Why is no real title available?)
Cited in
(4)
This page was built for publication: Strictly orthogonal left linear rewrite systems and primitive recursion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5935986)