Advertisement

Cheap tupling in calculational form

  • Zhenjiang Hu
  • Hideya Iwasaki
  • Masato Takeichi
Posters and Demonstrations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1140)

Keywords

Acid Rain Recursive Function Efficient Program Calculational Form Functional Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [Chi93]
    W. Chin. Towards an automated tupling strategy. In Proc. Conference on Partial Evaluation and Program Manipulation, pages 119–132, Copenhagen, June 1993. ACM Press.Google Scholar
  2. [GLJ93]
    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.Google Scholar
  3. [HIT96]
    Z. Hu, H. Iwasaki, and M. Takeichi. Deriving structural hylomorphisms from recursive definitions. In ACM SIGPLAN International Conference on Functional Programming, pages 73–82, Philadelphia, PA, May 1996. ACM Press.Google Scholar
  4. [TM95]
    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.Google Scholar
  5. [Wad88]
    P. Wadler. Deforestation: Transforming programs to eliminate trees. In Proc. ESOP (LNCS 300), pages 344–358, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Zhenjiang Hu
    • 1
  • Hideya Iwasaki
    • 2
  • Masato Takeichi
    • 1
  1. 1.Department of Information EngineeringUniversity of TokyoTokyoJapan
  2. 2.Department of Computer Science, Faculty of TechnologyTokyo University of Agriculture and TechnologyTokyoJapan

Personalised recommendations