Modular Termination Proofs for Rewriting Using Dependency Pairs

Jürgen Giesl, Thomas Arts, Enno Ohlebusch. Modular Termination Proofs for Rewriting Using Dependency Pairs. Journal of Symbolic Computation, 34(1):21-58, 2002. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.