A proof of weak termination providing the right way to terminate

Lecture Notes in Computer Science

Volumn 3407, Issue , 2005, Pages 356-371

  Fissore, Olivier ^a   Gnaedig, Isabelle ^a   Kirchner, Hélène ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; AUTOMATION; DATA REDUCTION; KNOWLEDGE BASED SYSTEMS; SCHEMATIC DIAGRAMS; TREES (MATHEMATICS);

DATA EVALUATION; GROUND TERMS; REWRITE SYSTEMS; TERMINATION PROPERTY;

LOGIC PROGRAMMING;

EID: 24644435441     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31862-0_26     Document Type: Conference Paper

References (20)

1. T. Arts and J. Giesl. Proving innermost normalization automatically. Technical Report 96/39, Technische Hochschule Darmstadt, Germany, 1996.
2. T. Arts and J. Giesl. Proving innermost normalisation automatically. In Proceedings 8th Conference on Rewriting Techniques and Applications, Sitges (Spain), volume 1232 of Lecture Notes in Computer Science, pages 157-171. Springer-Verlag, 1997.
3. Peter Borovanský, Claude Kirchner, Hélène Kirchner, Pierre-Etienne Moreau, and Christophe Ringeissen. An overview of ELAN. In Claude Kirchner and Hélène Kirchner, editors, Proceedings of the second International Workshop on Rewriting Logic and Applications, volume 15, http://www.elsevier.nl/locate/entcs/volume15.html, Pont-à-Mousson (France), September 1998. Electronic Notes in Theoretical Computer Science. Report LORIA 98-R-316.
4. Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, and José F. Quesada. Maude: Specification and programming in rewriting logic. Theoretical Computer Science, 285:187-243, 2002.
5. H. Comon. Disunification: a survey. In Jean-Louis Lassez and G. Plotkin, editors, Computational Logic. Essays in honor of Alan Robinson, chapter 9, pages 322-359. The MIT press, Cambridge (MA, USA), 1991.
6. N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17:279-301, 1982.
7. Nachum Dershowitz and Jean-Pierre Jouannaud. Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems, pages 244-320. Elsevier Science Publishers B. V. (North-Holland), 1990. Also as: Research report 478, LRI.
8. O. Fissore, I. Gnaedig, and H. Kirchner. Termination of rewriting with local strategies. In M. P. Bonacina and B. Gramlich, editors, Selected papers of the 4th International Workshop on Strategies in Automated Deduction, volume 58 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers B. V. (North-Holland), 2001.
9. O. Fissore, I. Gnaedig, and H. Kirchner. CARIBOO: An induction based proof tool for termination with strategies. In Proceedings of the Fourth International Conference on Principles and Practice of Declarative Programming, pages 62-73, Pittsburgh (USA), October 2002. ACM Press.
10. O. Fissore, I. Gnaedig, and H. Kirchner. Outermost ground termination. In Proceedings of the Fourth International Workshop on Rewriting Logic and Its Applications, volume 71 of Electronic Notes in Theoretical Computer Science, Pisa, Italy, September 2002. Elsevier Science Publishers B. V. (North-Holland).
11. O. Fissore, I. Gnaedig, and H Kirchner. Proving weak termination also provides the right way to terminate - Extended version. Technical report, LORIA, Nancy (France), March 2004. Available at http://www.loria.fr/~gnaedig/PAPERS/ REPORTS/wt-extended-2004.ps.
12. K. Futatsugi and A. Nakagawa. An overview of CAFE specification environment - an algebraic approach for creating, verifying, and maintaining formal specifications over networks. In Proceedings of the 1st IEEE Int. Conference on Formal Engineering Methods, 1997.
13. I. Gnaedig, H. Kirchner, and O. Fissore. Induction for innermost and outer-most ground termination. Technical Report A01-R-178, LORIA, Nancy (France), September 2001.
14. Goubault-Larreck. Well-founded recursive relations. In Proc. 15th Int. Workshop Computer Science Logic (CSL'2001), volume 2142 of Lecture Notes in Computer Science, Paris, 2001. Springer-Verlag.
15. J. Goubault-Larrecq. A proof of weak termination of typed lambda-sigma-calculi. In Proceedings of the TYPES'96 Workshop, volume 1512 of Lecture Notes in Computer Science, Aussois (France), 1998. Springer-Verlag.
16. Bernhard Gramlich. Relating innermost, weak, uniform and modular termination of term rewriting systems. In Andrei Voronkov, editor, Proceedings of the 3rd International Conference on Logic Programming and Automated Reasoning (LPAR'92), volume 624 of Lecture Notes in Computer Science, pages 285-296, St. Petersburg, Russia, July 1992. Springer-Verlag.
17. Bernhard Gramlich. On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems. Theoretical Computer Science, 165(1):97-131, September 1996.
18. G. Huet and J.-J. Lévy. Computations in orthogonal rewriting systems, I. In J.-L. Lassez and G. Plotkin, editors, Computational Logic, chapter 11, pages 395-414. The MIT press, 1991.
19. P. Klint. A meta-environment for generating programming environments. ACM Transactions on Software Engineering and Methodology, 2:176-201, 1993.
20. S. Lucas. Termination of rewriting with strategy annotations. In A. Voronkov and R. Nieuwenhuis, editors, Proc. of 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR'01, volume 2250 of Lecture Notes in Artificial Intelligence, pages 669-684, La Habana, Cuba, December 2001. Springer-Verlag, Berlin.