Syntactical Analysis of Total Termination

@inproceedings{Ferreira1994SyntacticalAO,
  title={Syntactical Analysis of Total Termination},
  author={Maria C. F. Ferreira and Hans Zantema},
  booktitle={ALP},
  year={1994}
}
Termination proofs by multiset path orderings imply primitive recursive derivation lengths. Any ground associative-commutative theory has a nite canonical system. 20 relation (! REmbF m) and F is nite, by Kruskal's theorem m is well-founded so we can apply theorem 2.4 to conclude that R is totally terminating. Although this result yields completeness, it is not easy to apply for proving that a particular TRS is not totally terminating, in contrast to the result of section 4. The type of orders… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.

Box 80.089 3508 TB Utrecht The Netherlands Syntactical analysis of total termination

M C F Syntactical Analysis Of Total Termination, H Ferreira, Zantema Technical Report Uu-Cs
Box 80.089 3508 TB Utrecht The Netherlands Syntactical analysis of total termination • 1994

Similar Papers

Loading similar papers…