Fusion with stacks and accumulating parameters

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Volumn , Issue , 2004, Pages 101-112

  Nishimura, Susumu ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Accumulating parameters; Higher order removal; Short cut fusion; Stacks; Type directed program transformation

Indexed keywords

ALGORITHMS; COMPUTER PROGRAM LISTINGS; COMPUTER SOFTWARE; DATA STRUCTURES; OPTIMIZATION; SEMANTICS; XML;

ACCUMULATING PARAMETERS; HIGHER-ORDER REMOVAL; SHORT-CUT FUSION; STACKS; TYPE-DIRECTED PROGRAM TRANSFORMATION;

COMPUTER PROGRAMMING;

EID: 11244338951     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1014007.1014018     Document Type: Conference Paper

References (27)

1. R. S. Bird. Using circular programs to eliminate multiple traversals of data. Acta Informatica, 21:239-250, 1984.
2. th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 375-388. ACM Press, 1994.
3. R. M. Burstall and J. Darlington. A transformation system for developing recursive programs. Journal of ACM, 24(1):44-67, 1977.
4. W.-N. Chin. Safe fusion of functional expressions II: Further improvements. Journal of Functional Programming, 4(4):515-555, 1994.
5. O. Chitil. Type inference builds a short cut to deforestation. In Proc. of International Conference on Functional Programming (ICFP'99), pages 249-260. ACM Press, 1999.
6. H. Ganzinger and R. Giegerich. Attribute coupled grammars. In Proceedings of the ACM SIGPLAN '84 Symposium on Compiler Construction, volume 19(6) of SIGPLAN Notices, pages 157-170, June 1984.
7. A. Gill. Cheap Deforestation for Non-strict Functional Languages. PhD thesis, University of Glasgow, 1996.
8. A. Gill, J. Launchbury, and S. Peyton Jones. A short cut to deforestation. In Proc. of the Conference on Functional Programming Languages and Computer Architecture, pages 223-232. ACM Press, June 1993.
9. The Haskell home page. http://www.haskell.org/.
10. J. E. Hopcroft, R. Motwani, and J. D. Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley, 2nd edition, 2001.
11. Z. Hu, H. Iwasaki, and M. Takeichi. Deriving structural hylomorphisms from recursive definitions. In Proc. of International Conference on Functional Programming, pages 73-82, Philadelphia, Pennsylvania, May 1996.
12. P. Johann. Short cut fusion is correct. Journal of Functional Programming, 13(4):797-814, 2003.
13. K. Kakehi, R. Glück, and Y. Futamura. An extension of shortcut deforestation for accumulative list folding. IEICE Transactions on Information and Systems, E85-D(9):1372-1383, 2002.
14. J. Launchbury and T. Sheard. Warm fusion: Deriving build-catas from recursive definitions. In International Conference on Functional Programming Languages and Computer Architecture, (FPCA'95), pages 314-323. ACM Press, 1995.
15. K. Nakano. Composing stack-attributed tree transducers. Technical Report METR-2004-01, Department of Mathematical Informatics, University of Tokyo, Japan, 2004.
16. K. Nakano and S. Nishimura. Deriving event-based document transformers from tree-based specifications. In LDTA '2001 Workshop on Language Descriptions, Tools and Applications, volume 44 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 2001.
17. S. Nishimura. Correctness of a higher-order removal transformation through a relational reasoning. In Programming Language and Systems, First Asian Symposium, APLAS 2003 Proceedings, volume 2895 of LNCS, pages 358-375. Springer Verlag, 2003. A full version is available as a preprint Kyoto-Math 2003-06 from http://www.math.kyoto-u.ac.jp/~susumu/papers/aplas03-long.ps.gz.
18. S. Nishimura and K. Nakano. XML stream transformer generation through program composition and dependency analysis, submitted.
19. A. Pitts. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science, 10(3):321-359, 2000.
20. T. Sheard and L. Fegaras. A fold for all seasons. In International Conference on Functional Programming Languages and Computer (FPCA'93), pages 233-242. ACM Press, 1993.
21. J. Svenningsson. Shortcut fusion for accumulating parameters & zip-like functions. In Proc. of the 2002 International Conference on Functional Programming, 2002.
22. A. Takano and E. Meijer. Shortcut deforestation in calculational form. In Proc. of International Conference on Functional Programming Languages and Computer Architecture (FPCA '95), pages 306-313. ACM Press, 1995.
23. J. H. van Groningen. Optimising recursive functions yielding multiple results in tuples in a lazy functional language. In Implementation of Functional Languages, 11th International Workshop, IFL'99, volume 1868 of Lecture Notes in Computer Science, pages 59-76. Springer Verlag, 1999.
24. J. Voigtländer. Using circular programs to deforest in accumulating parameters. In ASIAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 126-137. ACM Press, 2002.
25. J. Voigtländer. Using circular programs to deforest in accumulating parameters. Higher-Order and Symbolic Computation, 17(1), 2004.
26. P. Wadler. Theorems for free! In International Conference on Functional Programming and Computer Architecture (FPCA'89), pages 347-359. Addison-Wesley, 1989.
27. P. Wadler. Deforestation: transforming programs to eliminate trees. Theoretical Computer Science, 73(2):231-248, June 1990.