Type-inference based short cut deforestation (nearly) without inlining

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1868, Issue , 2000, Pages 19-35

  Chitil, Olaf ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; DEFORESTATION; METADATA;

FUNCTION DEFINITIONS; FUNCTIONAL PROGRAMS; INLINING; ORIGINAL ALGORITHMS; TYPE INFERENCES;

INFERENCE ENGINES;

EID: 84957004794     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722298_2     Document Type: Conference Paper

References (15)

1. Olaf Chitil. Type inference builds a short cut to deforestation. ACM SIGPLAN Notices, 34(9):249-260, September 1999. Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99)
2. L. Damas and R. Milner. Principal type-schemes for functional programs. In Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, pages 207-212. ACM Press, January 1982.
3. Martin Emms and Hans Leiß. Extending the type checker of Standard ML by polymorphic recursion. Theoretical Computer Science, 212(1-2):157-181, February 1999.
4. The Glasgow Haskell compiler. http://www.haskell.org/ghc/
5. Andrew Gill. Cheap Deforestation for Non-strict Functional Languages. PhD thesis, Glasgow University, 1996.
6. 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. ACM Press, 1993.
7. F. Henglein. Type inference with polymorphic recursion. ACM Transactions on Programming Languages and Systems, 15(2):253-289, 1993.
8. J. Hughes. Why Functional Programming Matters. Computer Journal, 32(2):98-107, 1989.
9. A. J. Kfoury, J. Tiuryn, and P. Urzyczyn. Type reconstruction in the presence of polymorphic recursion. ACM Transactions on Programming Languages and Systems, 15(2):290-311, 1993.
10. 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, pages 314-323. ACM Press, 1995.
11. 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.
12. A. Mycroft. Polymorphic type schemes and recursive definitions. In M. Paul and B. Robinet, editors, Proceedings of the International Symposium on Programming, LNCS 167, pages 217-228, Toulouse, France, April 1984. Springer
13. Simon L. Peyton Jones, John Hughes, et al. Haskell 98: A non-strict, purely functional language. http://www.haskell.org, February 1999.
14. Simon L. Peyton Jones and John Launchbury. Unboxed values as first class citizens in a non-strict functional language. In John Hughes, editor, Functional Programming Languages and Computer Architecture, LNCS 523, pages 636-666. Springer Verlag, June 1991.
15. Simon L. Peyton Jones and Simon Marlow. Secrets of the Glasgow Haskell compiler inliner. IDL '99, http://www.binnetcorp.com/wshops/IDL99.html, 1999.