Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Lecture Notes in Computer Science;H. Anderson,2005
2. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. TCS 236(1-2), 133–178 (2000)
3. Avanzini, M., Hirokawa, N., Middeldorp, A., Moser, G.: Proving termination of scheme programs by rewriting, http://cl-informatik.uibk.ac.at/~zini/publications/SchemeTR07.pdf
4. Lecture Notes in Computer Science;M. Avanzini,2008
5. Lecture Notes in Computer Science;M. Avanzini,2009