Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Programming Language Implementation and Logic Programming

PLILP 1996: Programming Languages: Implementations, Logics, and Programs pp 471–472Cite as

Cheap tupling in calculational form

  • Posters and Demonstrations
  • Conference paper
  • First Online:

  • 155 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1140))

This is a preview of subscription content, log in via an institution.

References

  1. 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. 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. 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. 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. P. Wadler. Deforestation: Transforming programs to eliminate trees. In Proc. ESOP (LNCS 300), pages 344–358, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Engineering, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, 113, Tokyo, Japan

    Zhenjiang Hu & Masato Takeichi

  2. Department of Computer Science, Faculty of Technology, Tokyo University of Agriculture and Technology, 2-24-16 Naka-cho, Koganei, 184, Tokyo, Japan

    Hideya Iwasaki

Authors
  1. Zhenjiang Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hideya Iwasaki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Masato Takeichi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Herbert Kuchen S. Doaitse Swierstra

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hu, Z., Iwasaki, H., Takeichi, M. (1996). Cheap tupling in calculational form. In: Kuchen, H., Doaitse Swierstra, S. (eds) Programming Languages: Implementations, Logics, and Programs. PLILP 1996. Lecture Notes in Computer Science, vol 1140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61756-6_105

Download citation

  • DOI: https://doi.org/10.1007/3-540-61756-6_105

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61756-3

  • Online ISBN: 978-3-540-70654-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation