Uncurrying for termination

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5330 LNAI, Issue , 2008, Pages 667-681

  Hirokawa, Nao ^a   Middeldorp, Aart ^b   Zankl, Harald ^b  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

DEPENDENCY PAIRS; FIRST ORDERS; NATURAL FRAMEWORKS; REWRITE RULES; TERM REWRITE SYSTEMS;

ARTIFICIAL INTELLIGENCE;

EID: 58049092040     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89439-1_46     Document Type: Conference Paper

References (20)

1. Aoto, T., Yamada, T.: Termination of simply typed term rewriting by translation and labelling. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 380-394. Springer, Heidelberg (2003)
2. Aoto, T., Yamada, T.: Termination of simply-typed applicative term rewriting systems. In: HOR 2004. Technical Report AIB-2004-03, RWTH Aachen, pp. 61-65 (2004)
3. Aoto, T., Yamada, T.: Dependency pairs for simply typed term rewriting. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 120-134. Springer, Heidelberg (2005)
4. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236(1-2), 133-178 (2000)
5. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press. Cambridge (1998)
6. Blanqui, F., Jouannaud, J.-P., Rubio, A.: HORPO with computability closure: A reconstruction. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 138-150. Springer, Heidelberg (2007)
7. Dershowitz, N.: 33 Examples of termination. In: French Spring School of Theoretical Computer Science. LNCS, vol. 909, pp. 16-26. Springer, Heidelberg (1995)
8. Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of rewrite systems. Journal of Automated Reasoning 40(2-3), 195-220 (2008)
9. Giesl, J., Thiemann, R., Schneider-Kamp, P.: The dependency pair framework: Combining techniques for automated termination proofs. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS, vol. 3452, pp. 301-331. Springer, Heidelberg (2005)
10. Giesl, J., Thiemann, R., Schneider-Kamp. P.: Proving and disproving termination of higher-order functions. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol. 3717, pp. 216-231. Springer, Heidelberg (2005)
11. Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and improving dependency pairs. Journal of Automated Reasoning 37(3), 155-203 (2006)
12. Hirokawa, N., Middeldorp, A.: Automating the dependency pair method. Information and Computation 199(1-2), 172-199 (2005)
13. Hirokawa, N., Middeldorp, A.: Tyrolean termination tool: Techniques and features. Information and Computation 205(4), 474-511 (2007)
14. Jouannaud, J.P., Rubio, A.: Polymorphic higher-order recursive path orderings. Journal of the ACM 54(1) (2007)
15. Kennaway, R., Klop, J.W., Sleep, M.R., de Vries, F.J.: Comparing curried and uncurried rewriting. Journal of Symbolic Computation 21(1), 15-39 (1996)
16. Kusakari, K., Sakai, M.: Enhancing dependency pair method using strong computability in simply-typed term rewriting. Applicable Algebra in Engineering, Communication and Computing 18(5), 407-431 (2007)
17. Thiemann, R.: The DP Framework for Proving Termination of Term Rewriting. PhD thesis, RWTH Aachen, Available as technical report AIB-2007-17 (2007)
18. Toyama, Y.: Termination of S-expression rewriting systems: Lexicographic path ordering for higher-order terms. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 40-54. Springer, Heidelberg (2004)
19. Xi, H.: Towards automated termination proofs through freezing. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol. 1379, pp. 271-285. Springer, Heidelberg (1998)
20. Zantema, H.: Termination. In: Terese (ed.) Term Rewriting Systems 2003. Cambridge Tracts in Theoretical Computer Science, vol. 55, pp. 181-259. Cambridge University Press, Cambridge (2003)