Program transformation and rewriting-Reference-Cited by-同舟云学术

Program transformation and rewriting

Published:1991 Issue: Volume: Page:226-239
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Bellegarde Françoise

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-53904-2_99.pdf

Reference20 articles.

1. L. Bachmair. Proofs methods for equational theories. PhD thesis, University of Illinois, Urbana-Champaign, 1987. Revised version, August 1988.

2. L. Bachmair, N. Dershowitz, and D. Plaisted. Completion without failure. In Proceedings of the colloquium on the resolution of Equations in Algebraic Structures, 1987.

3. F. Bellegarde and P. Lescanne. Transformation Orderings. In 12th Colloquium on Trees in Algebra and Programming, TAPSOFT, pages 69–80, Springer Verlag, Lecture Notes in Computer Science 249, 1987.

4. F. Bellegarde and P. Lescanne. Termination by Completion, Technical Report CRIN 90-R-028, 1990.

5. R. M. Burstall and J. Darlington. A Transformation System For Developing Recursive Programs. Journal of the Association for Computing Machinery, 24, pages 44–67, 1977.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generic Encodings and Static Analysis of Constructor Rewriting Systems;2023 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2023-09-11

2. Pattern Eliminating Transformations;Logic-Based Program Synthesis and Transformation;2021

3. Calculating software generators from solution specifications;TAPSOFT '95: Theory and Practice of Software Development;1995

4. ASTRE: Towards a fully automated program transformation system;Rewriting Techniques and Applications;1995