Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs

Explore this paper's citation graph

Summary

This work gives the first mechanized proof of the fact that for showing termination of a term rewrite system, it may restrict to well-formed terms using just the function symbols actually occurring in the rules of the system.

Type
article
Published
2010-08-23
Cited by
16
References
12

Keywords

Mathematical proof, Signature (topology), Dependency (UML), Computer science, Counterexample

References

Cited by

Related papers