Unfold/fold transformations preserving termination properties-Reference-Cited by-同舟云学术

Unfold/fold transformations preserving termination properties

Published:1992 Issue: Volume: Page:187-201
ISSN:0302-9743
Container-title:Programming Language Implementation and Logic Programming
language:
Short-container-title:

Author:

Amtoft Torben

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-55844-6_136

Reference24 articles.

1. Torben Amtoft. Unfold/fold transformations preserving termination properties. To appear as a technical report from DAIMI, University of Aarhus, Denmark, 1992.

2. R.M. Burstall and John Darlington. A transformation system for developing recursive programs. Journal of the ACM, 24(1):44–67, January 1977.

3. Anders Bondorf and Olivier Danvy. Automatic autoprojection of recursive equations with global variables and abstract data types. Science of Computer Programming, 16(2):151–195, 1991.

4. John Darlington and Helen Pull. A program development methodology based on a unified approach to execution and transformation. In D. BjØrner, A.P. Ershov, and N.D. Jones, editors, Partial Evaluation and Mixed Computation, pages 117–131. North-Holland, 1988.

5. Jean-Yves Girard, Yves Lafont, and Paul Taylor. Proofs and Types. Cambridge University Press, 1989.

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

1. An unfold/fold transformation framework for definite logic programs;ACM Transactions on Programming Languages and Systems;2004-05

2. Transformation Systems and Nondeclarative Properties;Computational Logic: Logic Programming and Beyond;2002

3. Total correctness by local improvement in the transformation of functional programs;ACM Transactions on Programming Languages and Systems;1996-03

4. Transformation of logic programs: Foundations and techniques;The Journal of Logic Programming;1994-05