Simplification and Termination of Strategies in Rule-Based Languages

Proceedings of the ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn 5, Issue , 2003, Pages 124-135

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

^a LORIA   (France)

Author keywords

Program simplification; Rewriting; Rule based languages; Strategies; Termination

Indexed keywords

FORMAL LANGUAGES; LOGIC PROGRAMMING; SEMANTICS; SOFTWARE ENGINEERING;

PROGRAM SIMPLIFICATION; REWRITING; RULE BASED LANGUAGES; TERMINATION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 1242287825     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/888251.888264     Document Type: Conference Paper

References (25)

1. T. Arts and J. Giesl. A collection of examples for termination of term rewriting using dependency pairs. Technical Report AIB-2001-09, RWTH Aachen, Germany, September 2001.
2. P. Borovanský, C. Kirchner, H. Kirchner, and Ch. Ringeissen. Rewriting with strategies in ELAN: a functional semantics. International Journal of Foundations of Computer Science, 1999.
3. Peter Borovanský, Claude Kirchner, Hélène Kirchner, and Pierre-Etienne Moreau. Elan from a rewriting logic point of view. Theoretical Computer Science, 285:155-185, August 2002.
4. N. Dershowitz, M. Okada, and G. Sivakumar. Canonical conditional rewrite systems. In E. Lusk and R. Overbeek, editors, Proceedings of the 9th International Conference on Automated Deduction, volume 310 of LNCS, pages 538-549, 1988.
5. 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.
6. M. Clavel et al. Maude: specification and programming in rewriting logic. Theoretical Computer Science, 285:187-243, August 2002.
7. O. Fissore, I. Gnaedig, and H. Kirchner. Termination of rewriting with local strategies. In M. P. Bonacina and B. Gramlich, editors, Electronic Notes in Theoretical Computer Science, volume 58. Elsevier Science Publishers, 2001. Also available as Technical Report A01-R-177, LORIA, Nancy (France).
8. 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 (PPDP), Pittsburgh, USA, October 2002. ACM Press.
9. 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.
10. O. Fissore, I. Gnaedig, and H. Kirchner. Termination of elan strategies by simplification - Extended version. Technical report, LORIA, 2003. Available at http://www.loria.fr/̃fissore/stratELAN/internal.html.
11. 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.
12. Joseph A. Goguen, Timothy Winkler, José Meseguer, Kokichi Futatsugi, and Jean-Pierre Jouannaud. Introducing OBJ. In Joseph A. Goguen and Grant Malcolm, editors, Software Engineering with OBJ: Algebraic Specification in Action, chapter 1, pages 3-167. Kluwer, Boston, 2000.
13. Bernhard Gramlich. On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems. Theoretical Computer Science, 165(1):97-131, September 1996.
14. M. Hanus. Reduction strategies for declarative programming. In B. Gramlich and S. Lucas, editors, Electronic Notes in Theoretical Computer Science, volume 57. Elsevier Science Publishers, 2001. Also available from http://www.elsevier.nl/locate/entcs/volume57.html.
15. M. Hanus and F. Steiner. Controlling search in declarative programs. In Principles of Declarative Programming (Proc. Joint International Symposium PLILP/ALP'98), pages 374-390. Springer LNCS 1490, 1998.
16. R. Kieburtz. A Logic for Rewriting Strategies. In M. P. Bonacina and B. Gramlich, editors, Electronic Notes in Theoretical Computer Science, volume 58. Elsevier Science Publishers, 2001.
17. P. Klint. A meta-environment for generating programming environments. ACM Transactions on Software Engineering and Methodology, 2:176-201, 1993.
18. S. Lucas. Termination of (canonical) context-sensitive rewriting. In S. Tison, editor, Proc. of 13th International Conference on Rewriting Techniques and Applications, RTA '02, Lecture Notes in Computer Science, pages 296-310, Copenhagen, Denmark, July 2002. Springer-Verlag, Berlin.
19. A.P. Martin, P. H. B. Gardiner, and J. C. P Woodcock. A tactic calculus - full version. Formal Aspects of Computing, 8(E):244-285, 1996.
20. Christian Schulte and Gert Smolka. Encapsulated search in higher-order concurrent constraint programming. In Maurice Bruynooghe, editor, Logic Programming: Proceedings of the 1994 International Symposium, pages 505-520, Ithaca, New York, USA, November 1994. MIT-Press.
21. Gert Smolka. The Oz programming model. In Jan van Leeuwen, editor, Computer Science Today, Lecture Notes in Computer Science, vol. 1000, pages 324-343. Springer-Verlag, Berlin, 1995.
22. J. van de Pol. Just-in-time: on strategy annotations. In B. Gramlich and S. Lucas, editors, Proceedings of the first International Workshop pn Reduction Strategies in Rewriting and Programming, WRS'01, volume 2359, pages 39-58, 2001.
23. Patrick Viry. Equational rules for rewriting logic. Theoretical Computer Science, 285:487-517, 2002.
24. Eelco Visser and Zine el Abidine Benaissa. A core language for rewriting. 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/volume16.html, Pont-à-Mousson (France), September 1998. Electronic Notes in Theoretical Computer Science.
25. Marian Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1, octobre 1994.