Proving and disproving termination of higher-order functions

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

Volumn 3717 LNAI, Issue , 2005, Pages 216-231

  Giesl, Jürgen ^a   Thiemann, René ^a   Schneider Kamp, Peter ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; MATHEMATICAL TECHNIQUES;

AUTOMATED TERMINATION PROVERS; DEPENDENCY PAIR TECHNIQUES; HIGHER-ORDER FUNCTIONS; TERM REWRITE SYSTEMS (TRS);

THEOREM PROVING;

EID: 33646193089     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11559306_12     Document Type: Conference Paper

References (37)

1. T. Aoto and T. Yamada. Termination of simply typed term rewriting systems by translation and labelling. In Proc. RTA '03, LNCS 2706, pages 380-394, 2003.
2. T. Aoto and T. Yamada. Termination of simply typed applicative term rewriting systems. In Proc. HOR '04, Report AIB-2004-03, RWTH, pages 61-65, 2004.
3. T. Aoto and T. Yamada. Dependency pairs for simply typed term rewriting. In Proc. RTA '05, LNCS 3467, pages 120-134, 2005.
4. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133-178, 2000.
5. F. Baader and T. Nipkow, Term Rewriting and All That. Cambridge, 1998.
6. R. Bird. Introduction to Functional Prog. using Haskell. Prentice Hall, 1998.
7. F. Blanqui. A type-based termination criterion for dependently-typed higher-order rewrite systems. In Proc. RTA '04, LNCS 3091, pages 24-39, 2004.
8. C. Borralleras and A. Rubio. A monotonic higher-order semantic path ordering. In Proc. LPAR '01, LNAI 2250, pages 531-547, 2001.
9. E. Contejean, C. Marché, B. Monate, and X. Urbain. CiME. http://cime.lri.fr.
10. N. Dershowitz. Termination of rewriting. J. Symb. Comp., 3:69-116, 1987.
11. K. Drosten, Termersetzungssysteme: Grundlagen der Prototyp-Generierung algebraischer Spezifikationen. Springer, 1989.
12. J. Giesl and T. Arts. Verification of Erlang processes by dependency pairs. Appl. Algebra in Engineering, Communication and Computing, 12(1,2):39-72, 2001.
13. J. Giesl, T. Arts, and E. Ohlebusch. Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation, 34(1):21-58, 2002.
14. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Improving dependency pairs. In Proc. LPAR '03, LNAI 2850, pages 165-179, 2003.
15. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Automated termination proofs with AProVE. In Proc. RTA '04, LNCS 3091, pages 210-220, 2004.
16. J. Giesl, R. Thiemann, and P. Schneider-Kamp. The DP framework: Combining techniques for autom. termination proofs. In Proc. LPAR '04, LNAI 3452, 2005.
17. J. Giesl, R. Thiemann, and P. Schneider-Kamp, Proving and disproving termination of higher-order functions. Technical Report AIB-2005-03, RWTH Aachen, 2005, Available from http://aib.informatik,rwth-aachen.de.
18. N. Hirokawa and A. Middeldorp. Automating the DP method. In Proc. CADE '03, LNAI 2741, pages 32-46, 2003, Full version in Information and Computation.
19. N. Hirokawa and A. Middeldorp, Tyrolean Termination Tool. In Proc. RTA '05, LNCS 3467, pages 175-184, 2005.
20. J.-P. Jouannaud and A. Rubio. Higher-order recursive path orderings. In Proc. LICS '99, pages 402-411, 1999.
21. D. Kapur, D. Musser, P. Narendran, and J. Stillman. Semi-unification. Theoretical Computer Science, 81(2):169-187, 1991.
22. R. Kennaway, J. W. Klop, R. Sleep, and F.-J. de Vries, Comparing curried and uncurried rewriting. Journal of Symbolic Computation, 21(1):15-39, 1996.
23. K. Kusakari, M. Nakamura, and Y. Toyama. Argument filtering transformation. In Proc. PPDP '99, LNCS 1702, pages 48-62, 1999.
24. K. Kusakari. On proving termination of term rewriting systems with higher-order variables, IPSJ Transactions on Programming, 42(SIG 7 (PRO 11)):35-45, 2001.
25. M. Lifantsev and L. Bachmair, An LPO-based termination ordering for higher-order terms without A-abstraction. In Proc. TPHOLs '98, LNCS 1479, 1998.
26. A. Mycroft. The theory and practice of transforming call-by-need into call-by-value. In Proc. 4th Int. Symp. on Programming, LNCS 83, pages 269-281, 1980.
27. A. Oliart and W. Snyder, A fast algorithm for uniform semi-unification. In Proc. CADE '98, LNCS 1421, pages 239-253, 1998.
28. D. A. Plaisted. A simple non-termination test for the Knuth-Bendix method. In Proc. CADE '86, LNCS 230, pages 79-88, 1986.
29. J. van de Pol. Termination of higher-order rewrite systems. PhD, Utrecht, 1996.
30. M. Sakai, Y. Watanabe, and T. Sakabe, An extension of dependency pair method for proving termination of higher-order rewrite systems. IEICE Transactions on Information and Systems, E84-D(8):1025-1032, 2001.
31. M. Sakai and K. Kusakari. On dependency pair method for proving termination of higher-order rewrite systems. IEICE Trans. on Inf. & Sys., 2005. To appear.
32. R. Thiemann, J. Giesl, and P. Schneider-Kamp. Improved modular termination proofs using dependency pairs. In Proc. IJCAR '04, LNAI 3097, pages 75-90, 2004.
33. Y. Toyama, Termination of S-expression rewriting systems: Lexicographic path ordering for higher-order terms. In Proc. RTA '04, LNCS 3091, pages 40-54, 2004.
34. TPDB web page, http://www.lri.fr/~marche/termination-competition/.
35. P. Wadler and J. Hughes. Projections for strictness analysis. In Proc. 3rd Int. Conf. Functional Prog. Lang. & Comp. Arch., LNCS 274, pages 385-407, 1987.
36. J. Waldmann. Matchbox: A tool for match-bounded string rewriting. In Proc. 15th RTA, LNCS 3091, pages 85-94, 2004.
37. H. Zantema. TORPA: Termination of string rewriting proved automatically. Journal of Automated Reasoning, 2005. To appear.