F. Baader & T. Nipkow (1998):
Term Rewriting and All That.
Cambridge University Press.
J. Endrullis, J. Waldmann & H. Zantema (2008):
Matrix Interpretations for Proving Termination of Term Rewriting.
Journal of Automated Reasoning 40(2-3),
pp. 195–220.
Available at http://dx.doi.org/10.1007/s10817-007-9087-9.
J. Giesl, R. Thiemann & P. Schneider-Kamp (2005):
Proving and Disproving Termination of Higher-Order Functions.
In: Proc. 5th International Workshop on Frontiers of Combining Systems,
LNCS 3717,
pp. 216–231.
Available at http://dx.doi.org/10.1007/11559306_12.
J. Giesl, R. Thiemann, P. Schneider-Kamp & S. Falke (2006):
Mechanizing and Improving Dependency Pairs.
Journal of Automated Reasoning 37(3),
pp. 155–203.
Available at http://dx.doi.org/10.1007/s10817-006-9057-7.
B. Gramlich (1995):
Abstract Relations between Restricted Termination and Confluence Properties of Rewrite Systems.
Fundamenta Informaticae 24(1-2),
pp. 3–23.
N. Hirokawa & A. Middeldorp (2005):
Automating the Dependency Pair Method.
Information and Computation 199(1-2),
pp. 172–199.
Available at http://dx.doi.org/10.1016/j.ic.2004.10.004.
N. Hirokawa & A. Middeldorp (2007):
Tyrolean Termination Tool: Techniques and Features.
Information and Computation 205(4),
pp. 474–511.
Available at http://dx.doi.org/10.1016/j.ic.2006.08.010.
N. Hirokawa, A. Middeldorp & H. Zankl (2008):
Uncurrying for Termination.
In: Proc. 15th International Conference on Logic for Programming, Artificial Intelligence and Reasoning,
LNCS (LNAI) 5330,
pp. 667–681.
Available at http://dx.doi.org/10.1007/978-3-540-89439-1_46.
N. Hirokawa & G. Moser (2008):
Automated Complexity Analysis Based on the Dependency Pair Method.
In: Proc. 4th International Joint Conference on Automated Reasoning,
LNCS (LNAI) 5195,
pp. 364–380.
Available at http://dx.doi.org/10.1007/978-3-540-71070-7_32.
D. Hofbauer & C. Lautemann (1989):
Termination Proofs and the Length of Derivations.
In: Proc. 3rd International Conference on Rewriting Techniques and Applications,
LNCS 355,
pp. 167–177.
Available at http://dx.doi.org/10.1007/3-540-51081-8_107.
R. Kennaway, J.W. Klop, M.R. Sleep & F.-J. de Vries (1996):
Comparing Curried and Uncurried Rewriting.
Journal of Symbolic Computation 21(1),
pp. 15–39.
M. Korp, C. Sternagel, H. Zankl & A. Middeldorp (2009):
Tyrolean Termination Tool 2.
In: Proc. 20th International Conference on Rewriting Techniques and Applications,
LNCS 5595,
pp. 295–304.
Available at http://dx.doi.org/10.1007/978-3-642-02348-4_21.
G. Moser, A. Schnabl & J. Waldmann (2008):
Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations.
In: Proc. 28th International Conference on Foundations of Software Technology and Theoretical Computer Science,
LIPIcs 2,
pp. 304–315.
Available at http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2008.1762.
F. Neurauter, H. Zankl & A. Middeldorp (2010):
Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting.
In: Proc. 17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning,
LNCS (ARCoSS) 6397,
pp. 550–564.
Available at http://dx.doi.org/10.1007/978-3-642-16242-8_39.
V. van Oostrom (2007):
Random Descent.
In: Proc. 18th International Conference on Rewriting Techniques and Applications,
LNCS 4533,
pp. 314–328.
Available at http://dx.doi.org/10.1007/978-3-540-73449-9_24.
M.R.K. Krishna Rao (2000):
Some Characteristics of Strong Innermost Normalization.
Theoretical Computer Science 239,
pp. 141–164.
Available at http://dx.doi.org/10.1016/S0304-3975(99)00215-7.
TeReSe (2003):
Term Rewriting Systems.
Cambridge Tracts in Theoretical Computer Science 55.
Cambridge University Press.
J. Waldmann (2010):
Polynomially Bounded Matrix Interpretations.
In: Proc. 21st International Conference on Rewriting Techniques and Applications,
LIPIcs 6,
pp. 357–372.
Available at http://dx.doi.org/10.4230/LIPIcs.RTA.2010.357.
H. Zankl & M. Korp (2010):
Modular Complexity Analysis via Relative Complexity.
In: Proc. 21st International Conference on Rewriting Techniques and Applications,
LIPIcs 6,
pp. 385–400.
Available at http://dx.doi.org/10.4230/LIPIcs.RTA.2010.385.
H. Zankl & A. Middeldorp (2010):
Satisfiability of Non-Linear (Ir)rational Arithmetic.
In: Proc. 16th International Conference on Logic for Programming, Artificial Intelligence and Reasoning,
LNCS (LNAI) 6355,
pp. 481–500.
eptcs@eptcs.org