Type inference builds a short cut to deforestation

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 34, Issue 9, 1999, Pages 249-259

  Chitil, Olaf ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; CLUSTERING ALGORITHMS; DIFFERENTIATION (CALCULUS); INFERENCE ENGINES; METADATA;

FUNCTIONAL PROGRAMS; INTERMEDIATE STRUCTURES; LINEAR-TIME ALGORITHMS; LOCAL TRANSFORMATION RULES; POLYMORPHIC TYPES; TRANSFORM FUNCTION; TYPE INFERENCES; TYPED LAMBDA CALCULUS;

DEFORESTATION;

EID: 17144368817     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/317765.317907     Document Type: Article

References (24)

1. Olaf Chitil. Adding an optimisation pass to the Glasgow Haskell compiler. Available from http://www-i2.informatik.rwth-aachen. de/~chitil, November 1997.
2. Leonidas Fegaras. Fusion for free! Technical Report CSE-96-001, Oregon Graduate Institute of Science and Technology, January 8, 1996.
3. The Glasgow Haskell compiler. Availabel from http://research.microsoft.com/ users/t-simonm/ghc/.
4. Andrew Gill. Cheap Deforestation for Non-strict Functional Languages. PhD thesis, Glasgow University, 1996.
5. Andrew Gill, John Launchbury, and Simon L. Peyton Jones. A Short Cut to Deforestation. In FPCA'93, Conference on Functional Programming Languages and Computer Architecture, pages 223-232, Copenhagen, Denmark, June 9-11, 1993. ACM Press.
6. Zhenjiang Hu, Hideya Iwasaki, and Masato Takeichi. Deriving structural hylomorphisms from recursive definitions. In Proceedings 1st ACM SIGPLAN Intl. Conf. on Functional Programming, ICFP'96, Philadelphia, PA, USA, 24-26 May 1996, pages 73-82, New York, 1996. ACM Press.
7. J. Hughes. Why Functional Programming Matters. Computer Journal, 32(2):98-107, 1989.
8. John Launchbury and Tim Sheard. Warm fusion: Deriving build-catas from recursive definitions. In Conf. Record 7th ACM SIGPLAN/SIGARCH Intl. Conf. on Functional Programming Languages and Computer Architecture, FPCA'95, La Jolla, San Diego, CA, USA, 25-28 June 1995, pages 314-323. ACM Press, New York, 1995.
9. Oukseh Lee and Kangkeun Yi. Proofs about a folklore let-polymorphic type inference algorithm. ACM Transactions on Programming Languages and Systems, 20(4):707-723, July 1998.
10. Simon Marlow. Deforestation for Higher-Order Functional Programs. PhD thesis, Glasgow University, 1995.
11. Erik Meijer, Maarten Fokkinga, and Ross Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In John Hughes, editor, Functional Programming Languages and Computer Architecture, pages 124-144. Springer Verlag, June 1991.
12. Erik Meijer and Graham Hutton. Bananas in space: Extending fold and unfold to exponential types. In Proceedings of the Seventh International Conference on Functional Programming Languages and Computer Architecture (FPCA'95), pages 324-333, La Jolla, California, June 25-28, 1995. ACM SIGPLAN/SIGARCH and IFIP WG2.8, ACM Press.
13. John Maraist, Martin Odersky, David N. Turner, and Philip Wadler. Call-by-name, call-by-value, call-by-need, and the linear lambda calculus. In 11'th International Conference on the Mathematical Foundations of Programming Semantics, New Orleans, Lousiana, March-April 1995.
14. Lázló Németh and Simon Peyton Jones. A design for warm fusion. In Proceedings of the 10th International Workshop on Implementation of Functional Languages, pages 381-393, 1998.
15. Simon L. Peyton Jones, John Hughes, et al. Haskell 98: A non-strict, purely functional language, http://www.haskell.org, February 1999.
16. A. M. Pitts. Parametric polymorphism and operational equivalence. Technical Report 453, Cambridge University Computer Laboratory, 1998. A preliminary version appeared in Proceedings, Second Workshop on Higher Order Operational Techniques in Semantics (HOOTS II), Stanford CA, December 1997, Electronic Notes in Theoretical Computer Science 10, 1998.
17. André Santos. Compilation by Transformation in Non-Strict Functional Languages. PhD thesis, Glasgow University, Department of Computing Science, 1995.
18. D. Sands. Proving the correctness of recursion-based automatic program transformations. Theoretical Computer Science, 167(1-2):193-233, October 1996.
19. Akihiko Takano and Erik Meijer. Shortcut deforestation in calculational form. In Proceedings of the Seventh International Conference on Functional Programming Languages and Computer Architecture (FPCA'95), pages 306-313, La Jolla, California, June 25-28, 1995. ACM SIGPLAN/SIGARCH and IFIP WG2.8, ACM Press.
20. Christian Tüffers. Erweiterung des Glasgow-Haskell-Compilers um die Erkennung von Hylomorphismen. Master's thesis, RWTH Aachen, 1998.
21. Philip Wadler. Theorems for free. In Functional Programming Languages and Computer Architecture, pages 347-359. ACM, 1989.
22. Philip Wadler. Deforestation: transforming programs to eliminate trees. Theoretical Computer Science, 73(2):231-248, June 1990.
23. J. B. Wells. Typability and type-checking in the second-order λ-calculus are equivalent and undecidable. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 176-185, Paris, France, 4-7 July 1994. IEEE Computer Society Press.
24. nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1999.