Calculation carrying programs - How to code program transformations-

International Workshop on Principles of Software Evolution (IWPSE)

Volumn 2000-January, Issue , 2000, Pages 250-259

  Takeichi, Masato ^a   Hu, Zhenjiang ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

SPECIFICATIONS;

CODE PROGRAMS; CORRECT CODE; NEW MECHANISMS;

PROGRAM COMPILERS;

EID: 84949809367     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPSE.2000.913246     Document Type: Conference Paper

References (33)

1. M. Alt, C. Fecht, C. Ferdinand, and R. Wilhelm. The Trafola-H system. In B. Krieg-Bruckner and B. Hoffmann, editors, PROgram Development by SPECification and TRAnsformation, volume 680 of LNCS, pages 539-570, 1993.
2. R. Backhouse. The calculational method. Special Issue on the Calculational Method, Information Processing Letters, 53:121, 1995.
3. T. Biggerstaff. Pattern matching for program generation: A user manual. Technical Report Technical Report MSR TR-98-55, Microsoft Research, 1998.
4. R. Bird. An introduction to the theory of lists. In M. Broy, editor, Logic of Programming and Calculi of Discrete Design, pages 5-42. Springer-Verlag, 1987.
5. R. Bird. Constructive functional programming. In STOP Summer School on Constructive Algorithmics, Abeland, 9 1989.
6. B. Bruckner, J. Liu, H. Shi, and B. Wolff. Towards correct, efficient and reusable transformational developments. In KORSO: Methods, Languages, and Tools for Construction of Correct Software, LNCS 1009, pages 270-184. Springer-Verlag, 1995.
7. R. Burstall and J. Darlington. A transformation system for developing recursive programs. Journal of the ACM, 24(1):44-67, Jan. 1977.
8. J. Cai, R. Page, and R. Tarjan. More efficient bottomup multi-pattern matching in trees. Theoretical Computer Science, 106(1):21-60, 1992.
9. W. Chin. Towards an automated tupling strategy. In Proc. Conference on Partial Evaluation and Program Manipulation, pages 119-132, Copenhagen, June 1993. ACM Press.
10. R. Crew. A language for examining abstract syntax trees. In Proc. of the Conf. on Domain-Specific Languages. Usenix, 1997.
11. R. Curien, Z. Qian, and H. Shi. Efficient secondorder matching. In 7th International Conference on Rewriting Techniques and Applications, pages 317-331. Springer Verlag (LNCS 1103), 1996.
12. O. de Moor and G. Sittampalam. Generic program transformation. In Third International Summer School on Advanced Functional Programming, Lecture Notes in Computer Science. Springer-Verlag, 1998.
13. O. de Moor and G. Sittampalam. Higher-order matching for program transformation. Draft avaliable at http://www.comlab.ox.ac.uk/oucl/peple/oege.demoor.html, Apr. 1999.
14. M. Fokkinga. Law and Order in Algorithmics. Ph. D thesis, Dept. INF, University of Twente, The Netherlands, 1992.
15. A. Gill, J. Launchbury, and S. P. Jones. A short cut to deforestation. In Proc. Conference on Functional Programming Languages and Computer Architecture, pages 223-232, Copenhagen, June 1993.
16. R. Heckmann. A functional langauge for the specification of complex tree transformation. In Proc. ESOP (LNCS 300), pages 175-190, 1988.
17. Z. Hu, H. Iwasaki, and M. Takeichi. Caculating accumulations. New Generation Computing, 17(2):153-173, 1999.
18. Z. Hu, H. Iwasaki, M. Takeichi, and A. Takano. Tupling calculation eliminates multiple data traversals. In ACM SIGPLAN International Conference on Functional Programming, pages 164-175, Amsterdam, The Netherlands, June 1997. ACM Press.
19. Z. Hu and M. Takeichi. Calculation carrying programs. Technical Report METR 99-07, Dept. of Mathematical Engineering, University of Tokyo, Sept. 1999.
20. Z. Hu, M. Takeichi, and W. Chin. Parallelization in calculational forms. In 25th ACM Symposium on Principles of Programming Languages, pages 316-328, San Diego, California, USA, Jan. 1998.
21. Z. Hu, M. Takeichi, and H. Iwasaki. Diffusion: Calculating efficient parallel programs. In 1999 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pages 85-94, San Antonio, Texas, Jan. 1999. BRICS Notes Series NS-99-1.
22. G. Huet and B. Lang. Proving and applying program transformations expressed with second-order pattersn. Acta Informatica, 11:31-55, 1978.
23. R. J. M. Hughes. A novel representation of lists and its application to the function reverse. Information Processing Letters, 22(3):141-144, Mar. 1986.
24. G. Hutton and E. Meijer. Monadic parsing in haskell. Journal of Functional Programming, 8(4):437-444, July 1998.
25. J. Launchbury and T. Sheard. Warm fusion: Deriving build-catas from recursive definitions. In Proc. Conference on Functional Programming Languages and Computer Architecture, pages 314-323, La Jolla, California, June 1995.
26. A. Malton. The denotational semantics of a functional tree-manipulation language. Computer Languages, 19(3):157-168, 1993.
27. E. Meijer, M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In Proc. Conference on Functional Programming Languages and Computer Architecture (LNCS 523), pages 124-144, Cambridge, Massachuetts, Aug. 1991.
28. S. Peyton Jones. The implementation of functional programming languages. Prentice-Hall, 1988.
29. F. Pfenning and C. Elliott. Higher-order abstract syntax. In ACM PLDI, pages 199-208. ACM Press, 1988.
30. Y. Sakai, Z. Hu, and M. Takeichi. An editing environment for program development by calculation. Submitted for publication, Oct. 2000.
31. W. Taha and T. Sheard. Multi-stage programming with explicit annotations. In Proc. Conference on Partial Evaluation and Program Manipulation, pages 203-217, Amsterdam, June 1997. ACM Press.
32. A. Takano and E. Meijer. Shortcut deforestation in calculational form. In Proc. Conference on Functional Programming Languages and Computer Architecture, pages 306-313, La Jolla, California, June 1995.
33. E. Visser, Z. Benaissa, and A. Tolmach. Building program optimizer with rewriting strategies. In ACM SIGPLAN International Conference on Functional Programming, pages 13-26, Baltimore, MD USA, Sept. 1998. ACM Press.