Computing constructor forms with non terminating rewrite programs

PPDP'06 - Proceedings of the Eight ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming

Volumn 2006, Issue , 2006, Pages 121-132

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

^a LORIA   (France)

Author keywords

Abstraction; Constructor; Narrowing; Ordering constraint; Sufficient completeness; Termination

Indexed keywords

ABSTRACTING; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; TREES (MATHEMATICS);

CONSTRUCTOR; NARROWING; ORDERING CONSTRAINT; SUFFICIENT COMPLETENESS; TERMINATION;

LOGIC PROGRAMMING;

EID: 33750921115     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1140335.1140351     Document Type: Conference Paper

References (31)

1. P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, and C. Ringeissen. An Overview of ELAN. In C. Kirchner and H. Kirchner, editors, Proceedings of the 2nd International Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, Pont-à-Mousson (France), Sept. 1998, Elsevier Science Publishers B. V. (North-Holland).
2. A. Bouhoula. Using induction and rewriting to verify and complete parameterized specifications. Theoretical Computer Science, 170 (1-2):245-276, 1996.
3. A. Bouhoula and F. Jaquemard. Automatic verification of. sufficient completeness for. specifications of complex data structures. Technical Report RR-LSV-05-17, INRIA, 2005.
4. A.-C. Caron, J.-L, Coquide, and M. Dauchet. Encompaasment properties and automata with constraints. In C. Kirchner, editor, Proceedings 5th Conference on Rewriting Techniques and Applications, Montreal (Canada), volume 690 of Lecture Notes in Computer Science, pages 328-342. Springer-Verlag, 1993.
5. M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. In J. Meseguer, editor, Proceedings of the 1st International Workshop on Rewriting Logic and its Applications, volume 5 of Electronic Notes in Theoretical Computer Science, Asilomar, Pacific Grove, CA, USA, September 1996. North Holland.
6. H. Comon. Sufficient completeness, term rewriting system and anti-unification. In J. Siekmann, editor, Proceedings 8th International Conference on Automated Deduction, Oxford (UK), volume 230 of Lecture Notes in Computer Science, pages 128-140. Springer-Verlag, 1986.
7. H. Comon. Inductionless induction, In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, chapter 14, pages 913-962. Elsevier Science, 2001.
8. H. Comon and F. Jacquemard. Ground reducibility is EXPTIME-complete. In Proc. 12th IEEE Symp. Logic in Computer Science, pages 26-34. IEEE Comp. Soc. Press, 1997.
9. E. Contejean, C. Marché, B. Monate, and X. Urbain. CiME version 2, 2000. http://cime.lri.fr/.
10. N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17:279-301, 1982.
11. N. Dershowitz and J.-P. 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.
12. M. C. et al. Maude: specification and programming in rewriting logic. Theoretical Computer Science, 285:187-243, August 2002.
13. 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.
14. O. Fissore, I. Gnaedig, and H. Kirchner. Outermost ground termination. In Proceedings of the 4th 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).
15. O. Fissore, I. Gnaedig, and H. Kirchner. A proof of weak termination providing the right way to terminate. In 1st International Colloquium on THEORETICAL ASPECTS OF COMPUTING, volume 3407 of Lecture Notes in Computer Science, pages 356-371, Guiyang, China, September 2004. Springer-Verlag.
16. 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.
17. 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.
18. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Improving dependency pairs. In Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR '03), volume 2850 of Lecture Notes in Artificial Intelligence, pages 165-179, Almaty, Kazakhstan, 2003. Springer-Verlag.
19. I. Gnaedig and H. Kirchner. Computing Constructor Forms with Non Terminating Rewrite Programs - Extended version. Technical report, LORIA, Nancy (France), 2006. Available at http://www.loria.fr/~gnaedig/PAPERS/REPORTS/comp- extended-2006.pdf.
20. I. Gnaedig, H. Kirchner, and O. Fissore. Induction for innermost and outermost ground termination. Technical Report A01-R-178, LORIA, Nancy (France), September 2001.
21. G. Huet and J.-M. Hullot. Proofs by induction in equational theories with constructors. Journal of Computer and System Sciences, 25(2):239-266, Oct. 1982, Preliminary version in Proceedings 21st Symposium on Foundations of Computer Science, IEEE, 1980.
22. J.-P. Jouannaud and E. Kounalis. Automatic proofs by induction in theories without constructors. Information and Computation, 82:1-33, 1989.
23. D. Kapur, P. Narendran, and H. Zhang. Proof by induction using test sets. In Proceedings 8th International Conference on Automated Deduction, Oxford (UK), volume 230 of Lecture Notes in Computer Science, pages 99-117. Springer-Verlag, 1986.
24. D. Kapur, P. Narendran, and H. Zhang. On sufficient completeness and related properties of term rewriting systems. Acta Informatica, 24:395-415, 1987.
25. P. Klint. A meta-environment for generating programming environments. A CM Transactions on Software Engineering and Methodology, 2:176-201, 1993.
26. E. Kounalis. Completeness in data type specifications. In B. Buchberger, editor, Proceedings EUROCAL Conference, Lim (Austria), volume 204 of Lecture Notes in Computer Science, pages 348-362, Springer-Verlag, 1985.
27. E. Kounalis. Testing for the ground (co-)reducibility property in term-rewriting systems. Theoretical Computer Science, 106:87-117, 1992.
28. A. Lazrek, P. Lescanne, and J.-J. Thiel. Tools for proving inductive equalities, relative completeness and incompleteness. Information and Computation, 84(1):47-70, Jan. 1990.
29. P.-E. Moreau, C. Ringeissen, and M. Vittek. A Pattern Matching Compiler for Multiple Target Languages. In G. Hedin, editor, 18th Conference on Compiler Construction, Warsaw (Poland), volume 2622 of LNCS, pages 61-76. Springer-Verlag, May 2003.
30. T. Nipkow and G. Weikum. A decidability result about sufficient completeness of axiomatically specified abstract data types. In 6th GI Conference, volume 145 of Lecture Notes in Computer Science, pages 257-268, Springer-Verlag, 1983.
31. D. Plaisted. Semantic confluence tests and completion methods. Information and Control, 65:182-215, 1985.