Concatenate, reverse and map vanish for free

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2002, Pages 14-25

  Voigtländer, Janis ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Combinators; Correctness proofs; Denotational semantics; List abstraction; Parametricity; Program transformation; Rank 2 types; Shortcut deforestation; The concatenate vanishes; Theorems for free

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; ERROR CORRECTION; OPTIMIZATION; SEMANTICS; THEOREM PROVING;

DENOTATIONAL SEMANTICS; FUNCTIONAL PROGRAMS; PROGRAM TRANSFORMATION;

PROGRAM TRANSLATORS;

EID: 0036954571     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/583852.581481     Document Type: Conference Paper

References (30)

1. http://wwwtcs.inf.tu-dresden.de/~voigt/Vanish.lhs.
2. The Haskell 98 Report. http://haskell.org/onlinereport.
3. E. Albert, C. Ferri, F. Steiner, and G. Vidal. Improving functional logic programs by difference-lists. In Advances in Computing Science, Penang, Malaysia, Proceedings, volume 1961 of LNCS, pages 237-254, Springer-Verlag, 2000.
4. R. Bird. The promotion and accumulation strategies in transformational programming. ACM Trans. on Prog. Lang. and Systems, 6:487-504, 1984.
5. R. Bird. Addendum Ibid., 7:490-492, 1985.
6. E. Boiten. The many disguises of accumulation. Technical Report 91-26, Dept. of Informatics, University of Nijmegen, 1991.
7. O. Chitil. Type inference builds a short cut to deforestation. In International Conference on Functional Programming, Paris, France, Proceedings, pages 249-260. ACM Press, 1999.
8. O. Chitil. Type-Inference Based Deforestation of Functional Programs. PhD thesis, RWTH Aachen, 2000.
9. O. Chitil. Compositional explanation of types and algorithmic debugging of type errors. In International Conference on Functional Programming, Florence, Italy, Proceedings, pages 193-204. ACM Press, 2001.
10. A. Gill. Cheap Deforestation for Non-strict Functional Languages. PhD thesis, University of Glasgow, 1996.
11. A. Gill, J. Launchbury, and S. Peyton Jones. A short cut to deforestation. In Functional Programming Languages and Computer Architecture, Copenhagen, Denmark, Proceedings, pages 223-232. ACM Press, 1993.
12. Z. Hu, H. Iwasaki, and M. Takeichi. Calculating accumulations. New Generation Computing, 17:153-173, 1999.
13. J. Hughes. A novel representation of lists and its application to the function "reverse". Information Processing Letters, 22:141-144, 1986.
14. J. Hughes. The design of a pretty-printing library. In Advanced Functional Programming, volume 925 of LNCS, pages 53-96. Springer-Verlag, 1995.
15. P. Johann. Short cut fusion: Proved and improved. In Semantics, Applications, and Implementation of Program Generation, Florence, Italy, Proceedings, volume 2196 of LNCS, pages 47-71. Springer-Verlag, 2001.
16. A. Kühnemann, R. Glück, and K. Kakehi. Relating accumulative and non-accumulative functional programs. In Rewriting Techniques and Applications, Utrecht, The Netherlands, Proceedings, volume 2051 of LNCS, pages 154-168. Springer-Verlag, 2001.
17. J. Launchbury and R. Paterson. Parametricity and unboxing with unpointed types. In European Symposium on Programming, Linköping, Sweden, Proceedings, volume 1058 of LNCS, pages 204-218. Springer-Verlag, 1996.
18. D. Leivant. Polymorphic type inference. In Principles of Programming Languages, Austin, Texas, Proceedings, pages 88-98. ACM Press, 1983.
19. B. McAdam. Repairing Type Errors in Functional Programs. PhD thesis, University of Edinburgh, 2002.
20. A. Moran and D. Sands. Improvement in a lazy context: An operational theory for call-by-need. In Principles of Programming Languages, San Antonio, Texas, Proceedings, pages 43-56. ACM Press, 1999.
21. S. Peyton Jones, W. Partain, and A. Santos. Let-floating: Moving bindings to give faster programs. In International Conference on Functional Programming, Philadelphia, Pennsylvania, Proceedings, pages 1-12. ACM Press, 1996.
22. S. Peyton Jones and A. Santos. A transformation-based optimiser for Haskell. Sci. of Comput. Prog., 32:3-47, 1998.
23. A. Pitts. Parametric polymorphism and operational equivalence. Math. Struct. Comput. Sci., 10:321-359, 2000.
24. J. Reynolds. Types, abstraction and parametric polymorphism. In Information Processing, Paris, France, Proceedings, pages 513-523. Elsevier Science Publishers B.V., 1983.
25. D. Schmidt. Denotational Semantics: A Methodology for Language Development. Allyn and Bacon, 1986.
26. T. Sheard, Z. Benaissa, and M. Martel. Introduction to multistage programming using MetaML. http://cse.ogi.edu/~sheard/papers/manual.ps.
27. J. Svenningsson. Shortcut fusion for accumulating parameters and zip-like functions. In International Conference on Functional Programming, Pittsburgh, Pennsylvania, Proceedings. ACM Press, 2002.
28. P. Wadler. The concatenate vanishes. Note, University of Glasgow, 1987 (revised, 1989).
29. P. Wadler. Theorems for free! In Functional Programming Languages and Computer Architecture, London, England, Proceedings, pages 347-359. ACM Press, 1989.
30. J. Yang, G. Michaelson, P. Trinder, and J. Wells. Improved type error reporting. In Implementation of Functional Languages, Aachen, Germany, Draft Proceedings, pages 71-86, 2000.