Deriving structural hylomorphisms from recursive definitions

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 31, Issue 6, 1996, Pages 73-82

  Hu, Zhenjiang ^a   Iwasaki, Hideya ^a   Takeichi, Masato ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17144381685     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/232629.232637     Document Type: Article

References (14)

1. R.S. Bird and O. de Moor. Relational program derivation and context-free language recognition. In A.W. Roscoe, editor, A Classical Mind, pages 17-35. Prentice Hall, 1994.
2. W. Chin. Safe fusion of functional expressions. In Proc. Conference on Lisp and Functional Programming, San Francisco, California, June 1992.
3. M. Fokkinga. Law and Order in Algorithmics. Ph.D thesis, Dept. INF, University of Twente, The Netherlands, 1992.
4. L. Fegaras, T. Sheard, and T. Zhou. Improving programs which recurse over multiple inductive structures. In Proc. PEPM'94, June 1994.
5. 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.
6. Z. Hu, H. Iwasaki, and M. Takeichi. Making recursions manipulable by constructing medio-types. Technical Report METR 95-04, University of Tokyo, 1995. (URL: http://www.ipl.t.u-tokyo.ac.jp/∼hu/pub/METR95-04.ps.gz).
7. R.B. Kieburtz and J. Lewis. Algebraic design language. OGI Technical Report 94-002, Oregon Graduate Institution of Sci. and Tech., 1994.
8. 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.
9. G. Malcolm. Data structures and program transformation. Science of Computer Programming, (14):255-279, August 1990.
10. 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, August 1991.
11. T. Sheard and L. Fegaras. A fold for all seasons. In Proc. Conference on Functional Programming Languages and Computer Architecture, pages 233-242, Copenhagen, June 1993.
12. M. Takeichi. Partial parametrization eliminates multiple traversals of data structures. Acta Informatica, 24:57-77, 1987.
13. 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.
14. P. Wadler. Deforestation: Transforming programs to eliminate trees. In Proc. ESOP (LNCS 300), pages 344-358, 1988.