Program transformation by templates based on term rewriting

PPDP'05 - Proceedings of the Seventh ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn 2005, Issue , 2005, Pages 59-69

  Chiba, Yuki ^a   Aoto, Takahito ^a   Toyama, Yoshihito ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

Inductive Theorem Proving; Program Transformation; Term Rewriting; Tree Homomorphism

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; MATHEMATICAL TRANSFORMATIONS; PATTERN MATCHING; PROBLEM SOLVING; SEMANTICS;

INDUCTIVE THEOREM PROVING; PROGRAM TRANSFORMATIONS; TERM REWRITING; TREE HOMOMORPHISM;

AUTOMATIC PROGRAMMING;

EID: 33746037594     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1069774.1069780     Document Type: Conference Paper

References (19)

1. P. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
2. A. Bouhoula, E. Kounalis, and M. Rusinowitch. Automated mathematical induction. Journal of Logic and Computation, 5(5):631-668, 1995.
3. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. 1997.
4. R. Curien, Z. Qian, and H. Shi. Efficient second-order matching. In Proceedings of the 7th International Conference on Rewriting Techniques and Applications, volume 1103 of LNCS, pages 317-331. Springer-Verlag, 1996.
5. O. de Moor and G. Sittampalam. Generic program transformation. In Proceedings of the 3rd International Summer School on Advanced Functional Programming, volume 1608 of LNCS, pages 116-149, Springer-Verlag, 1999.
6. O. de Moor and G. Sittampalam. Higher-order matching for program transformation. Theoretical Computer Science, 269:135-162, 2001.
7. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Automated termination proofs with AProVE. In Proceedings of the 15th International Conference on Rewriting Techniques and Applications, volume 3091 of LNCS, pages 210-220. Springer-Verlag, 2004.
8. K. Hirata, K. Yamada, and M. Harao. Tractable and intractable second-order matching problems. Journal of Symbolic Computation, 37(5):611-628, 2004.
9. N. Hirokawa and A. Middeldorp. Tsukuba termination tool. In Proceedings of the 14th International Conference on Rewriting Techniques and Applications, volume 2706 of LNCS, pages 311-320. Springer-Verlag, 2003.
10. G. Huet. A unification algorithm for typed λ-culculus. Theoretical Computer Science, 1:27-57, 1975.
11. G. Huet and B. Lang. Proving and applying program transformations expressed with, second order patterns. Acta Informatica, 11:31-55, 1978.
12. S. Kamin and J.-J. Levy. Two generalizations of the recursive path ordering. Unpublished manuscript, University of Illinois, 1980.
13. U. S. Reddy. Term rewriting induction. In Proceedings of the 10th International Conference on Automated Deduction, volume 449 of LNAI, pages 162-177, 1990.
14. G. Sittampalam. Higher-Order Matching for Program. Transformation. PhD thesis, Magdalen College, 2001.
15. Terese. Term Rewriting Systems. Cambridge University Press, 2003.
16. Y. Toyarna. Commutativity of term rewriting systems. In The Second France-Japan Artificial Intelligence and Computer Science Symposium, 1987.
17. Y. Toyama, How to prove equivalence of term rewriting systems without induction, Theoretical Computer Science, 90:369-390, 1991.
18. Eelco Visser. A survey of rewriting strategies in program transformation systems. In Workshop on Reduction Strategies in Rewriting and Programming, volume 57 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2001.
19. T. Yokoyama, Z. Hu, and M. Takeichi. Deterministic second-order patterns. Information Processing Letters, 89(6):309-314, 2004.